On list-coloring outerplanar graphs
From MaRDI portal
Recommendations
- On list-coloring extendable outerplanar graphs
- List edge coloring of outer-1-planar graphs
- On list \(r\)-hued coloring of outer-1-planar graphs
- Acyclic list edge coloring of outerplanar graphs
- List total coloring of pseudo-outerplanar graphs
- List colourings of planar graphs
- On the colorings of outerplanar graphs
- Multiple list colouring of planar graphs
- List-colourings of graphs
- scientific article; zbMATH DE number 2188336
Cites work
- Color-critical graphs on a fixed surface
- Distance constraints in graph color extensions
- Every planar graph is 5-choosable
- Extending graph colorings
- Graph color extensions: When Hadwiger's conjecture and embeddings help
- scientific article; zbMATH DE number 890665 (Why is no real title available?)
- List colourings of planar graphs
- Precoloring extension forK4-minor-free graphs
- The colour theorems of Brooks and Gallai extended
- You can't paint yourself into a corner
Cited in
(19)- The list chromatic numbers of some planar graphs
- On list r-hued coloring of planar graphs
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
- Defective choosability results for outerplanar and related graphs
- Acyclic list edge coloring of outerplanar graphs
- On list \(k\)-coloring convex bipartite graphs
- On list \(r\)-hued coloring of outer-1-planar graphs
- On list-coloring extendable outerplanar graphs
- List colorings of K₅-minor-free graphs with special list assignments
- Adapted list coloring of planar graphs
- scientific article; zbMATH DE number 1559030 (Why is no real title available?)
- The polynomial method for list-colouring extendability of outerplanar graphs
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- scientific article; zbMATH DE number 2188336 (Why is no real title available?)
- Some Conjectures and Questions in Chromatic Topological Graph Theory
- On DP-coloring of outerplanar graphs
- Degree-truncated DP-colourability of \(K_{2, 4}\)-minor-free graphs
- Degree-truncated choosability of graphs
- Degree-truncated Alon-Tarsi number of outerplanar graphs
This page was built for publication: On list-coloring outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528160)