Works matching IS 03649024 AND DT 1999 AND VI 32 AND IP 4
Results: 8
More than one tough chordal planar graphs are Hamiltonian.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 405, doi. 10.1002/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-Z
- By:
- Publication type:
- Article
Coloring of trees with minimum sum of colors.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 354, doi. 10.1002/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B
- By:
- Publication type:
- Article
Intersection representation of digraphs in trees with few leaves.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 340, doi. 10.1002/(SICI)1097-0118(199912)32:4<340::AID-JGT3>3.0.CO;2-R
- By:
- Publication type:
- Article
A lower bound for partial list colorings.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 390, doi. 10.1002/(SICI)1097-0118(199912)32:4<390::AID-JGT6>3.0.CO;2-D
- By:
- Publication type:
- Article
Improved bounds for the chromatic index of graphs and multigraphs.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 311, doi. 10.1002/(SICI)1097-0118(199912)32:4<311::AID-JGT1>3.0.CO;2-X
- By:
- Publication type:
- Article
Perfectly contractile diamond-free graphs.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 359, doi. 10.1002/(SICI)1097-0118(199912)32:4<359::AID-JGT5>3.0.CO;2-U
- By:
- Publication type:
- Article
On critically perfect graphs.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 394, doi. 10.1002/(SICI)1097-0118(199912)32:4<394::AID-JGT7>3.0.CO;2-Z
- By:
- Publication type:
- Article
Dirac's map-color theorem for choosability.
- Published in:
- Journal of Graph Theory, 1999, v. 32, n. 4, p. 327, doi. 10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B
- By:
- Publication type:
- Article