Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable

DOI10.1016/j.disc.2015.10.037zbMath1327.05117arXiv1409.4054OpenAlexW1893468339MaRDI QIDQ898165

Gexin Yu, Xiangwen Li, Runrun Liu

Publication date: 8 December 2015

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

Full work available at URL: https://arxiv.org/abs/1409.4054

zbMATH Keywords

planar graphsdischargingSteinberg conjecturerelaxed coloringBordeaux conjecturesuperextendability

Mathematics Subject Classification ID

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

Related Items (10)

Every planar graph with girth at least 5 is \((1,9)\)-colorable ⋮ Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable ⋮ The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles ⋮ Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable ⋮ Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ A relaxation of Novosibirsk 3-color conjecture ⋮ A relaxation of the Bordeaux conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-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
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• A sufficient condition for planar graphs to be 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Colorings of plane graphs: a survey
• Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
• Near-colorings: non-colorable graphs and NP-completeness
• A relaxation of the Bordeaux conjecture
• Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
• A 3-color theorem on plane graphs without 5-circuits
• Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• A relaxation of the strong Bordeaux Conjecture
• Improper colorability of planar graphs with cycles of length neither 4 nor 6
• On $(3,1)^*$-Coloring of Plane Graphs
• A Relaxation of Steinberg's Conjecture
• Improper Choosability of Planar Graphs without 4-Cycles
• On a conjecture of B. Grünbaum

This page was built for publication: Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable