Acyclic 6-choosability of planar graphs without adjacent short cycles

DOI10.1007/S11425-013-4572-6zbMATH Open1299.05137OpenAlexW2113729506MaRDI QIDQ476645FDOQ476645

Authors: Ge Zhang, Min Chen, Weifan Wang 

Publication date: 2 December 2014

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-013-4572-6

Recommendations

• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
• Planar graphs without 4-cycles are acyclically 6-choosable
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• Edge-choosability of planar graphs without chordal 6-cycles
• Structural properties and edge choosability of planar graphs without 6-cycles
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• The 4-choosability of planar graphs without 6-cycles
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Improper choosability of planar graphs without 6-circuits
• Planar graphs without chordal 6-cycles are 4-choosable

zbMATH Keywords

planar graphacyclic coloringacyclic choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• 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
• Acyclic 4-choosability of planar graphs withot cycles of specific lengths
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Acyclic colorings of planar graphs
• Every planar graph is 5-choosable
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• Title not available (Why is that?)
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• A sufficient condition for planar graphs to be acyclically 5-choosable
• Acyclic 4-choosability of planar graphs with girth at least 5
• Acyclic 5-choosability of planar graphs without small cycles
• Planar graphs without 4-cycles are acyclically 6-choosable
• Acyclic list 7‐coloring of planar graphs
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 4-choosability of planar graphs
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• On acyclic 4-choosability of planar graphs without short cycles

Cited In (9)

• Injective choosability of subcubic planar graphs with girth 6
• Planar graphs without 4-cycles are acyclically 6-choosable
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
• Acyclic 4-choosability of planar graphs without 4-cycles.
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Acyclic 4-choosability of planar graphs without intersecting short cycles
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
• Title not available (Why is that?)

This page was built for publication: Acyclic 6-choosability of planar graphs without adjacent short cycles

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