On the structure of graphs with a unique k-factor.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 4, p. 227, doi. 10.1002/1097-0118(200012)35:4<227::AID-JGT1>3.0.CO;2-D
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2000 AND VI 35 AND IP 4
Results: 5
1
2
An extremal bandwidth problem for bipartite graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 4, p. 278, doi. 10.1002/1097-0118(200012)35:4<278::AID-JGT5>3.0.CO;2-U
- By:
- Publication type:
- Article
3
An accessibility theorem for infinite graph minors.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 4, p. 273, doi. 10.1002/1097-0118(200012)35:4<273::AID-JGT4>3.0.CO;2-B
- By:
- Publication type:
- Article
4
Clique-inverse graphs of K<sub>3</sub>-free and K<sub>4</sub>-free graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 4, p. 257, doi. 10.1002/1097-0118(200012)35:4<257::AID-JGT3>3.0.CO;2-4
- By:
- Publication type:
- Article
5
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 4, p. 244, doi. 10.1002/1097-0118(200012)35:4<244::AID-JGT2>3.0.CO;2-H
- By:
- Publication type:
- Article