Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph

DOI10.1016/j.ejc.2014.08.020zbMath1301.05273OpenAlexW2055259450MaRDI QIDQ458589

Jinghan Xu, Ying Qian Wang

Publication date: 8 October 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2014.08.020

zbMATH Keywords

Steinberg's conjectureweak Bordeaux conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Colorings of plane graphs without long monochromatic facial paths ⋮ Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable ⋮ Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a graph into forests
• Decomposing a planar graph with girth 9 into a forest and a matching
• A note on list improper coloring of plane graphs
• A sufficient condition for planar graphs to be 3-colorable
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Covering planar graphs with forests
• A note on the three color problem
• A step towards the strong version of Havel's three color conjecture
• Improper colorability of planar graphs without prescribed short cycles
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
• \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
• 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
• List Improper Colourings of Planar Graphs
• Edge-partitions of planar graphs and their game coloring numbers
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• A Grötzsch-Type Theorem for List Colourings with Impropriety One
• 没有4至6-圈的平面图是(1,0,0)-可染的
• On $(3,1)^*$-Coloring of Plane Graphs
• Improper Choosability of Planar Graphs without 4-Cycles
• Decomposition of Finite Graphs Into Forests
• A note on list improper coloring planar graphs

This page was built for publication: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph