Works matching IS 03649024 AND DT 2002 AND VI 40 AND IP 2
Results: 6
Forbidden subgraphs that imply hamiltonian-connectedness*.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 104, doi. 10.1002/jgt.10034
- By:
- Publication type:
- Article
On chromatic-choosable graphs.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 130, doi. 10.1002/jgt.10033
- By:
- Publication type:
- Article
Hamiltonian cycles in n-extendable graphs.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 75, doi. 10.1002/jgt.10050
- By:
- Publication type:
- Article
A Ramsey-type problem and the Turán numbers*.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 120, doi. 10.1002/jgt.10032
- By:
- Publication type:
- Article
Tiled partial cubes.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 91, doi. 10.1002/jgt.10031
- By:
- Publication type:
- Article
Acyclic list 7-coloring of planar graphs.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 83, doi. 10.1002/jgt.10035
- By:
- Publication type:
- Article