Improper colorability of planar graphs with cycles of length neither 4 nor 6
From MaRDI portal
Publication:5017791
DOI10.1360/012012-70zbMATH Open1488.05206OpenAlexW2317220875MaRDI QIDQ5017791FDOQ5017791
Authors: Lingji Xu, 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/012012-70
Recommendations
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Improper colorability of planar graphs without prescribed short cycles
- Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
- Planar graphs without cycles of length 4 or 7 are \((2, 0, 0)\)-colorable
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (17)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Note on improper coloring of 1-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
- A note on improper colorability of planar graphs
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- Improper choosability of planar graphs without 4-cycles
- A relaxation of Novosibirsk 3-color conjecture
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
- Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
- Title not available (Why is that?)
- Improper colorability of planar graphs without prescribed short cycles
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
This page was built for publication: Improper colorability of planar graphs with cycles of length neither 4 nor 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017791)
