\((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
From MaRDI portal
Publication:2075512
DOI10.1016/j.disc.2021.112758zbMath1482.05111arXiv2001.00166OpenAlexW2997033502MaRDI QIDQ2075512
Li-Gang Jin, Pei-Pei Liu, Ying-Li Kang, Ying Qian Wang
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00166
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (1)
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
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
- Distance constraints on short cycles for 3-colorability of planar graphs
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Improper colorability of planar graphs with cycles of length neither 4 nor 6
- 没有4至6-圈的平面图是(1,0,0)-可染的
- On $(3,1)^*$-Coloring of Plane Graphs
- A Relaxation of Steinberg's Conjecture
- Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable
This page was built for publication: \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
