Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable
DOI10.1360/012014-50zbMATH Open1488.05139OpenAlexW2327889826MaRDI QIDQ5017899FDOQ5017899
Authors: Pei-Pei Liu, Yingqian Wang 
Publication date: 17 December 2021
Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1360/012014-50
Recommendations
- Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Planar graphs without 4-cycle or chordal-6-cycle are \( (3, 0, 0)\)-colorable
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)
Cited In (23)
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
- Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs
- Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
- Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
- Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable
- Planar graphs without short even cycles are near-bipartite
- Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
- Title not available (Why is that?)
- Planar graphs without 4-cycle or chordal-6-cycle are \( (3, 0, 0)\)-colorable
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- Improper colorability of planar graphs without prescribed short cycles
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
This page was built for publication: Planar graphs without cycles of length 4 or 7 are \((2, 0, 0)\)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017899)
