Construction of acyclically 4-colourable planar triangulations with minimum degree 4
From MaRDI portal
Publication:5031739
DOI10.1080/00207160.2018.1476684zbMath1499.05175OpenAlexW2804307487MaRDI QIDQ5031739
Zepeng Li, Jin Xu, Zehui Shao, En-Qiang Zhu
Publication date: 16 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2018.1476684
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic coloring of graphs without bichromatic long path
- Flips in planar graphs
- Note to the paper of Grünbaum on acyclic colorings
- Every planar graph has an acyclic 7-coloring
- Every planar graph has an acyclic 8-coloring
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- On generating planar graphs
- Every toroidal graph is acyclically 8-choosable
- Construction of planar triangulations with minimum degree 5
- Bemerkungen zum Vierfarbenproblem
- A sufficient condition for planar graphs to be acyclically 5-choosable
- A History of Flips in Combinatorial Triangulations
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
- Generation of Triangulations of the Sphere
- A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
- Acyclic colorings of planar graphs
This page was built for publication: Construction of acyclically 4-colourable planar triangulations with minimum degree 4