(\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
From MaRDI portal
Publication:394211
DOI10.1016/j.disc.2013.08.005zbMath1280.05038OpenAlexW2021114999MaRDI QIDQ394211
Publication date: 24 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.005
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items
1-planar graphs with girth at least 6 are (1,1,1,1)-colorable ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence of unavoidable sets of geographically good configurations
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- On $(3,1)^*$-Coloring of Plane Graphs
This page was built for publication: (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
