On choosability with separation of planar graphs without adjacent short cycles
From MaRDI portal
Publication:723623
DOI10.1007/s40840-016-0409-0zbMath1391.05104OpenAlexW2510248580MaRDI QIDQ723623
Min Chen, Ko-Wei Lih, Wei Fan Wang
Publication date: 24 July 2018
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-016-0409-0
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
A sufficient condition for planar graphs to be (3,1)-choosable ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) ⋮ Choosability with union separation of triangle-free planar graphs ⋮ Choosability with separation of planar graphs without prescribed cycles ⋮ On \((3, r)\)-choosability of some planar graphs
Cites Work
- List colourings of planar graphs
- Every planar graph is 5-choosable
- A not 3-choosable planar graph without 3-cycles
- On Choosability with Separation of Planar Graphs with Forbidden Cycles
- Brooks-type theorems for choosability with separation
- Choosability with Separation of Complete Multipartite Graphs and Hypergraphs
- Unnamed Item
- Unnamed Item
