Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable

DOI10.1016/j.disc.2016.06.011zbMath1343.05054OpenAlexW2500835095MaRDI QIDQ738860

Min Chen, Chuanni Zhang, Ying Qian Wang

Publication date: 16 August 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.06.011

zbMATH Keywords

planar graphdischargingreducible configuration\((d_1,d_2,\ldots,d_k)\)-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable ⋮ A relaxation of Novosibirsk 3-color conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• Distance constraints on short cycles for 3-colorability of planar graphs
• \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
• Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
• Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable
• A relaxation of Havel's 3-color problem
• On 3-colorability of planar graphs without adjacent short cycles
• Planar graphs without adjacent cycles of length at most seven 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 relaxation of the Bordeaux conjecture
• Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
• Improper colorability of planar graphs without prescribed short cycles
• A 3-color theorem on plane graphs without 5-circuits
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
• A relaxation of the strong Bordeaux Conjecture
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• On $(3,1)^*$-Coloring of Plane Graphs
• A Relaxation of Steinberg's Conjecture

This page was built for publication: Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable