On r-hued list coloring of K₄ ( 7 )-minor free graphs
From MaRDI portal
Publication:2065804
Recommendations
Cites work
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- Coloring the square of a \(K_{4}\)-minor free graph
- Conditional colorings of graphs
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Dynamic coloring parameters for graphs with given genus
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Graph \(r\)-hued colorings -- a survey
- Graph theory
- List-colouring the square of a \(K_4\)-minor-free graph
- On r-hued coloring of K₄-minor free graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On dynamic coloring for planar graphs and graphs of higher genus
- On the list dynamic coloring of graphs
- The four-colour theorem
- Upper bounds of r-hued colorings of planar graphs
Cited in
(5)
This page was built for publication: On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065804)