scientific article; zbMATH DE number 6914816
From MaRDI portal
Publication:4578234
zbMath1402.05080MaRDI QIDQ4578234
Publication date: 8 August 2018
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 (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Acyclic 6-choosability of planar graphs without adjacent short 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
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable
- Every toroidal graph is acyclically 8-choosable
- A sufficient condition for planar graphs to be acyclically 5-choosable
- Acyclic 5-choosability of planar graphs without adjacent short cycles
- 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 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
- On the acyclic choosability of graphs
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs
This page was built for publication:
