Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
DOI10.1016/J.EJC.2014.08.020zbMATH Open1301.05273OpenAlexW2055259450MaRDI QIDQ458589FDOQ458589
Authors: Jinghan Xu, Yingqian 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
Recommendations
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- Decomposition of planar graphs with forbidden configurations
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Decomposition of Finite Graphs Into Forests
- A note on list improper coloring of plane graphs
- Title not available (Why is that?)
- List Improper Colourings of Planar Graphs
- A Grötzsch-Type Theorem for List Colourings with Impropriety One
- Improper choosability of planar graphs without 4-cycles
- A note on list improper coloring planar graphs
- Title not available (Why is that?)
- Covering planar graphs with forests
- On \((3,1)^*\)-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
- A note on the three color problem
- Title not available (Why is that?)
- Edge-partitions of planar graphs and their game coloring numbers
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- 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
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- 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
- Planar graphs without cycles of length from 4 to 6 are \((1,0,0)\)-colorable
Cited In (12)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
- Decomposition of planar graphs without 5-cycles or \(K_4\)
- Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
- 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
- Decomposing a planar graph into an independent set and a 3-degenerate graph
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles
- Decomposition of planar graphs with forbidden configurations
This page was built for publication: Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458589)
