scientific article
From MaRDI portal
Publication:3115199
zbMath1249.05108MaRDI QIDQ3115199
Publication date: 20 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (10)
Acyclically 4-colorable triangulations ⋮ A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic 4-choosability of planar graphs ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ 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
This page was built for publication:
