Dynamic coloring parameters for graphs with given genus
From MaRDI portal
(Redirected from Publication:1682887)
Abstract: A proper vertex coloring of a graph is -dynamic if for each , at least colors appear in . In this paper we investigate -dynamic versions of coloring, list coloring, and paintability. We prove that planar and toroidal graphs are 3-dynamically 10-colorable, and this bound is sharp for toroidal graphs. We also give bounds on the minimum number of colors needed for any in terms of the genus of the graph: for sufficiently large , every graph with genus is -dynamically -colorable when and -dynamically -colorable when . Furthermore, each of these upper bounds for -dynamic -colorability also holds for -dynamic -choosability and for -dynamic -paintability. We develop a method to prove that certain configurations are reducible for each of the corresponding -dynamic parameters.
Recommendations
Cites work
- A survey on the distance-colouring of graphs
- Brooks' theorem via the Alon-Tarsi theorem
- Dynamic coloring and list dynamic coloring of planar graphs
- Every planar graph is 5-choosable
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- Largest planar graphs of diameter two and fixed maximum degree
- List colourings of planar graphs
- List Dynamic Coloring of Sparse Graphs
- List-coloring the square of a subcubic graph
- Mr. Paint and Mrs. Correct
- On \(r\)-dynamic coloring of graphs
- On \(r\)-dynamic coloring of grids
- On r-hued coloring of K₄-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- On the list dynamic coloring of graphs
- On the total coloring of planar graphs.
- On-line list colouring of graphs
Cited in
(24)- List 3-dynamic coloring of graphs with small maximum average degree
- List r-dynamic coloring of graphs with small maximum average degree
- Upper bounds of r-hued colorings of planar graphs
- 3-dynamic coloring of planar triangulations
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- On the \(r\)-dynamic coloring of subdivision-edge coronas of a path
- On the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph
- On the r-dynamic coloring of the direct product of a path with either a path or a cycle
- Graph \(r\)-hued colorings -- a survey
- Game connectivity of graphs
- On list 3-dynamic coloring of near-triangulations
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- List \(r\)-dynamic coloring of sparse graphs
- Dynamic list coloring of 1-planar graphs
- Brooks-type theorem for \(r\)-hued coloring of graphs
- On \(r\)-dynamic coloring of graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- The $r$-dynamic edge coloring of a closed helm graph
- List 3-dynamic colorings of planar graphs
- Upper bound of the list r-hued chromatic number
- A note on the r-hued coloring of planar graphs
- The r-dynamic chromatic number is bounded in the strong 2-coloring number
- Improved bounds of r-hued colorings of planar graphs
This page was built for publication: Dynamic coloring parameters for graphs with given genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682887)