Graphs omitting a bushy tree.
- Published in:
- Journal of Graph Theory, 1997, v. 26, n. 4, p. 203, doi. 10.1002/(SICI)1097-0118(199712)26:4<203::AID-JGT4>3.0.CO;2-U
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 1997 AND VI 26 AND IP 4
Results: 5
1
2
Bandwidth edge counts for linear arrangements of rectangular grids.
- Published in:
- Journal of Graph Theory, 1997, v. 26, n. 4, p. 195, doi. 10.1002/(SICI)1097-0118(199712)26:4<195::AID-JGT3>3.0.CO;2-L
- By:
- Publication type:
- Article
3
Coloring graphs which have equibipartite complements.
- Published in:
- Journal of Graph Theory, 1997, v. 26, n. 4, p. 183, doi. 10.1002/(SICI)1097-0118(199712)26:4<183::AID-JGT2>3.0.CO;2-M
- By:
- Publication type:
- Article
4
End-faithful spanning trees in T<sub>1</sub>-free graphs.
- Published in:
- Journal of Graph Theory, 1997, v. 26, n. 4, p. 175, doi. 10.1002/(SICI)1097-0118(199712)26:4<175::AID-JGT1>3.0.CO;2-N
- By:
- Publication type:
- Article
5
The graph constructions of Hajós and Ore.
- Published in:
- Journal of Graph Theory, 1997, v. 26, n. 4, p. 211, doi. 10.1002/(SICI)1097-0118(199712)26:4<211::AID-JGT5>3.0.CO;2-T
- By:
- Publication type:
- Article