Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 1, doi. 10.1002/jgt.20486
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2011 AND VI 66 AND IP 1
Results: 7
1
2
Short proofs for two theorems of Chien, Hell and Zhu.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 83, doi. 10.1002/jgt.20515
- By:
- Publication type:
- Article
3
Monochromatic cycle partitions of edge-colored graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 57, doi. 10.1002/jgt.20492
- By:
- Publication type:
- Article
4
Facial non-repetitive edge-coloring of plane graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 38, doi. 10.1002/jgt.20488
- By:
- Publication type:
- Article
5
On vertex partitions and some minor-monotone graph parameters.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 49, doi. 10.1002/jgt.20490
- By:
- Publication type:
- Article
6
On directed local chromatic number, shift graphs, and Borsuk-like graphs.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 65, doi. 10.1002/jgt.20494
- By:
- Publication type:
- Article
7
On hitting all maximum cliques with an independent set.
- Published in:
- Journal of Graph Theory, 2011, v. 66, n. 1, p. 32, doi. 10.1002/jgt.20487
- By:
- Publication type:
- Article