Acyclically 4-colorable triangulations

DOI10.1016/J.IPL.2015.12.005MaRDI QIDQ264190zbMATH OpenOpenAlexFDO

Authors Zepeng Li, Zehui Shao, Enqiang Zhu, Jin Xu

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

triangletriangulationacyclic 4-coloringclaw

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• 4-Colored Triangulation of 3-Maps
• On acyclically 4-colorable maximal planar graphs
• Acyclic edge coloring of planar graphs without intersecting triangles and cycles of length four
• Quadrangulations and 4-color-critical graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Triangle-free four-chromatic graphs
• A 4-colour problem for dense triangle-free graphs
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
• Acyclic edge colorings of planar graphs without 4-cycles

Cites work

• scientific article; zbMATH DE number 3565019 (Why is no real title available?)
• scientific article; zbMATH DE number 3616457 (Why is no real title available?)
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Acyclic 4-choosability of planar graphs withot cycles of specific lengths
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic coloring with few division vertices
• Acyclic colorings of graph subdivisions revisited
• Acyclic colorings of planar graphs
• Fast generation of planar graphs
• Graph theory
• Graphs with maximum degree 6 are acyclically 11-colorable
• Graphs with maximum degreee 5 are acyclically 7-colorable
• Negative results on acyclic improper colorings
• Note on a paper of B. Grünbaum on acyclic colorings
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
• The Planar Hamiltonian Circuit Problem is NP-Complete

Cited in

(8)

• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Acyclic coloring with few division vertices
• On acyclically 4-colorable maximal planar graphs
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• scientific article; zbMATH DE number 7651161 (Why is no real title available?)
• Acyclic coloring of graphs with maximum degree at most six
• Akempic triangulations with 4 odd vertices
• 4-Colored Triangulation of 3-Maps

Describes a project that uses

Uses Software

• plantri

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264190)