scientific article
From MaRDI portal
Publication:2857451
zbMath1274.05113MaRDI QIDQ2857451
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311002034
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Some simplified NP-complete graph problems
- A sufficient condition for planar graphs to be 3-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- A 3-color theorem on plane graphs without 5-circuits
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
This page was built for publication:
