Minimum choosability of planar graphs
From MaRDI portal
Recommendations
- A note on the minimum number of choosability of planar graphs
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- List edge coloring of planar graphs without 6-cycles with two chords
- Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
- List-edge-coloring of planar graphs without 6-cycles with three chords
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- A note on the minimum number of choosability of planar graphs
- Coloring of double disk graphs
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colourings of multigraphs
- Minimum total coloring of planar graph
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Cited in
(11)- Path choosability of planar graphs
- \(k\)-frugal list coloring of planar graphs without small cycles
- Spanning Trees—Short or Small
- Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable
- Choosability of planar graphs
- 2-distance choosability of planar graphs with a restriction for maximum degree
- Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable
- A note on the minimum number of choosability of planar graphs
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7
- Optimal \(r\)-dynamic coloring of sparse graphs
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords
This page was built for publication: Minimum choosability of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724728)
