The 3-choosability of special plane graphs with girth of 4 at least
From MaRDI portal
Publication:2990587
zbMATH Open1349.05081MaRDI QIDQ2990587FDOQ2990587
Authors: Cui-Qi Wang, Xiaoying Zhu 
Publication date: 10 August 2016
Recommendations
- On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable
- On 3-choosability of plane graphs without 5-, 8- and 9-cycles
- The 3-choosability of plane graphs without 8-, 9- and 10-cycles
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (7)
- The 3-choosability of plane graphs without 8-, 9- and 10-cycles
- Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable
- The 3-choosability of plane graphs of girth 4
- On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- On 3-choosability of plane graphs without 5-, 8- and 9-cycles
- Acyclic 3-choosability of sparse graphs with girth at least 7
This page was built for publication: The 3-choosability of special plane graphs with girth of 4 at least
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2990587)
