On acyclically 4-colorable maximal planar graphs

DOI10.1016/J.AMC.2018.02.015MaRDI QIDQ2318233zbMATH OpenOpenAlexFDO

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

Publication date 14 August 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2018.02.015

zbMATH Keywords

acyclically coloringenumerationlocally equitable coloringmaximal planar graphsnecessary and sufficient condition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Acyclically 4-colorable triangulations
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
• Acyclic coloring with few division vertices
• Acyclic 4-coloring of planar graphs without 4- and 5-cycles
• Acyclic coloring with few division vertices

Cites work

• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Acyclic 4-choosability of planar graphs withot cycles of specific lengths
• Acyclic colorings of planar graphs
• Acyclically 4-colorable triangulations
• Coloring with no 2-colored \(P_4\)'s
• Efficient computation of sparse hessians using coloring and automatic differentiation
• Good and semi-strong colorings of oriented planar graphs
• Graph theory
• scientific article; zbMATH DE number 3565019 (Why is no real title available?)
• Layout of Graphs with Bounded Tree-Width
• Minimum feedback vertex set and acyclic coloring.
• 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 Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices

Cited in

(3)

• Acyclically 4-colorable triangulations
• Acyclic edge coloring of graphs with maximum degree 4
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4

Describes a project that uses

Uses Software

• ColPack

This page was built for publication: On acyclically 4-colorable maximal planar graphs

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