The 3-choosability of plane graphs of girth 4
From MaRDI portal
Publication:1781982
Recommendations
- On 3-choosability of plane graphs of girth no less than 4 without 7-, 8- and 15-cycles
- The 3-choosability of special plane graphs with girth of 4 at least
- The choosability of some 4-reduced plane graphs
- A not 3-choosable planar graph without 3-cycles
- On 3-choosability of plane graphs having no 3-, 6-, 7- and 8-cycles
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- Colorings and orientations of graphs
- Every planar graph is 5-choosable
- Graph theory
- List colourings of planar graphs
- Multicriterial graph problems with MAXMIN criterion
- The complexity of planar graph choosability
Cited in
(10)- On 3-choosability of planar graphs without certain cycles
- DP-3-coloring of some planar graphs
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
- A sufficient condition for a planar graph to be 3-choosable
- DP-3-coloring of planar graphs without certain cycles
- On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs
- Bordeaux 3-color conjecture and 3-choosability
- Planar graphs without specific cycles are 2-degenerate
This page was built for publication: The 3-choosability of plane graphs of girth 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781982)
