Acyclically 4-colorable triangulations

DOI10.1016/j.ipl.2015.12.005zbMath1357.05049OpenAlexW2239283028MaRDI QIDQ264190

Zehui Shao, Zepeng Li, Jin Xu, En-Qiang Zhu

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.12.005

zbMATH Keywords

triangletriangulationclawacyclic 4-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Unnamed Item ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ On acyclically 4-colorable maximal planar graphs ⋮ Acyclic coloring of graphs with maximum degree at most six

Uses Software

• plantri

Cites Work

• Acyclic coloring with few division vertices
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• Acyclic colorings of graph subdivisions revisited
• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Note on a paper of B. Grünbaum on acyclic colorings
• Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
• Graphs with maximum degree 5 are acyclically 7-colorable
• Acyclic Colourings of Planar Graphs with Large Girth
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
• Acyclic colorings of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Acyclically 4-colorable triangulations