Acyclically 4-colorable triangulations
From MaRDI portal
Publication:264190
DOI10.1016/J.IPL.2015.12.005zbMATH Open1357.05049OpenAlexW2239283028MaRDI QIDQ264190FDOQ264190
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
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
- Graph theory
- 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
- Acyclic 4-colorability of planar graphs without cycles of length 4 or 6
- Graphs with maximum degreee 5 are acyclically 7-colorable
- Acyclic 4-choosability of planar graphs withot cycles of specific lengths
- Fast generation of planar graphs
- Negative results on acyclic improper colorings
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic coloring with few division vertices
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
- Acyclic colorings of planar graphs
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
- Title not available (Why is that?)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- Acyclic coloring of graphs with maximum degree at most six
- Akempic triangulations with 4 odd vertices
- 4-Colored Triangulation of 3-Maps
Uses Software
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)
