On chromatic numbers of two extensions of planar graphs
From MaRDI portal
Publication:2000818
Recommendations
- Choosability of \(K_5\)-minor-free graphs
- An extension of Thomassen's result on choosability
- Construction of \(K_{n}\)-minor free graphs with given circular chromatic number
- Group chromatic number of graphs without \(K_5\)-minors
- On colorability of graphs with forbidden minors along paths and circuits
Cites work
- scientific article; zbMATH DE number 2044931 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A note on group choosability of graphs with girth at least 4
- Acyclic colorings of planar graphs
- Circular choosability
- Circular choosability of graphs
- Circular choosability via combinatorial Nullstellensatz
- Coloring with no 2-colored \(P_4\)'s
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- On acyclic colorings of planar graphs
- On chromatic number of graphs and set-systems
- On group choosability of graphs. I.
- On group choosability of graphs. II
Cited in
(4)
This page was built for publication: On chromatic numbers of two extensions of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000818)