On the perfect orderability of unions of two graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 33, n. 1, p. 32, doi. 10.1002/(SICI)1097-0118(200001)33:1<32::AID-JGT4>3.0.CO;2-Y
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2000 AND VI 33 AND IP 1
Results: 5
1
2
Maximal sets of Hamilton cycles in K<sub>n,n</sub>.
- Published in:
- Journal of Graph Theory, 2000, v. 33, n. 1, p. 25, doi. 10.1002/(SICI)1097-0118(200001)33:1<25::AID-JGT3>3.0.CO;2-T
- By:
- Publication type:
- Article
3
The circular chromatic number of series-parallel graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 33, n. 1, p. 14, doi. 10.1002/(SICI)1097-0118(200001)33:1<14::AID-JGT2>3.0.CO;2-#
- By:
- Publication type:
- Article
4
Average distance, minimum degree, and spanning trees.
- Published in:
- Journal of Graph Theory, 2000, v. 33, n. 1, p. 1, doi. 10.1002/(SICI)1097-0118(200001)33:1<1::AID-JGT1>3.0.CO;2-L
- By:
- Publication type:
- Article
5
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors.
- Published in:
- Journal of Graph Theory, 2000, v. 33, n. 1, p. 44, doi. 10.1002/(SICI)1097-0118(200001)33:1<44::AID-JGT5>3.0.CO;2-O
- By:
- Publication type:
- Article