On the number of shredders.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 195, doi. 10.1002/(SICI)1097-0118(199907)31:3<195::AID-JGT4>3.0.CO;2-E
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 1999 AND VI 31 AND IP 3
Results: 7
1
2
Extremal graphs in connectivity augmentation.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 179, doi. 10.1002/(SICI)1097-0118(199907)31:3<179::AID-JGT3>3.0.CO;2-7
- By:
- Publication type:
- Article
3
Generation of isospectral graphs.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 255, doi. 10.1002/(SICI)1097-0118(199907)31:3<255::AID-JGT7>3.0.CO;2-6
- By:
- Publication type:
- Article
4
Vertices contained in every minimum dominating set of a tree.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 163, doi. 10.1002/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-T
- By:
- Publication type:
- Article
5
The distribution of nodes of given degree in random trees.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 227, doi. 10.1002/(SICI)1097-0118(199907)31:3<227::AID-JGT6>3.0.CO;2-6
- By:
- Publication type:
- Article
6
A characterization of P<sub>4</sub>-indifference graphs.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 155, doi. 10.1002/(SICI)1097-0118(199907)31:3<155::AID-JGT1>3.0.CO;2-R
- By:
- Publication type:
- Article
7
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs.
- Published in:
- Journal of Graph Theory, 1999, v. 31, n. 3, p. 201, doi. 10.1002/(SICI)1097-0118(199907)31:3<201::AID-JGT5>3.0.CO;2-T
- By:
- Publication type:
- Article