IC-Planar Graphs Are 6-Choosable
From MaRDI portal
Publication:5009330
DOI10.1137/20M133261XzbMath1470.05044OpenAlexW3192131378MaRDI QIDQ5009330
Ko-Wei Lih, Wanshun Yang, Wei Fan Wang, Yi Qiao Wang
Publication date: 20 August 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m133261x
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Recognizing and drawing IC-planar graphs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- 5-choosability of graphs with crossings far apart
- List colourings of planar graphs
- Ortho-polygon visibility representations of embedded graphs
- Every planar graph is 5-choosable
- New results on edge partitions of 1-plane graphs
- 3-list-coloring planar graphs of girth 5
- The structure of plane graphs with independent crossings and its applications to coloring problems
- An improved upper bound for the acyclic chromatic number of 1-planar graphs
- Acyclic coloring of IC-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- \(\mathsf{NIC}\)-planar graphs
- Recognizing hole-free 4-map graphs in cubic time
- On Choosability with Separation of Planar Graphs with Forbidden Cycles
- Coloring plane graphs with independent crossings
- 5-Coloring Graphs with 4 Crossings
- Graphs with Two Crossings Are 5-Choosable
- Chromatic number, independence ratio, and crossing number
- Recognizing IC-Planar and NIC-Planar Graphs
- A new proof of the 6 color theorem
- Coupled choosability of plane graphs
- Acyclic colouring of 1-planar graphs
This page was built for publication: IC-Planar Graphs Are 6-Choosable
