Graph r-hued colorings -- a survey
From MaRDI portal
Publication:2172387
Recommendations
Cites work
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- 2-distance coloring of planar graphs with girth 5
- 2-distance coloring of sparse graphs
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- 3-dynamic coloring of planar triangulations
- 3-hued coloring of planar graphs
- r-dynamic coloring of the corona product of graphs
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)
- r-hued coloring of Cartesian product of path with its square
- \(r\)-hued coloring of planar graphs without short cycles
- r-hued coloring of sparse graphs
- A bound on the chromatic number of the square of a planar graph
- A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- A Dual form of Kuratowski's Theorem
- A note on the chromatic number of the square of the Cartesian product of two cycles
- A short proof of Kneser's conjecture
- A survey on the distance-colouring of graphs
- A unified approach to distance-two colouring of graphs on surfaces
- An ant colony algorithm for graph coloring and labeling problems
- An improved bound on 2-distance coloring plane graphs with girth 5
- An optimal square coloring of planar graphs
- Bounding the chromatic number of squares of \(K_4\)-minor-free graphs
- Choosability conjectures and multicircuits
- Choosability of the square of a planar graph with maximum degree four
- Chromatic number of square of maximal outerplanar graphs
- Circular chromatic number: A survey
- Coloring graph products---a survey
- Coloring squares of planar graphs with girth six
- Coloring the square of a \(K_{4}\)-minor free graph
- Coloring the square of a sparse graph G with almost (G) colors
- Coloring the square of an outerplanar graph
- Colouring problems
- Complexity of conditional colorability of graphs
- Conditional colorings of graphs
- Decomposition and r-hued coloring of K₄(7)-minor free graphs
- Dynamic chromatic number of regular graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Dynamic coloring of graphs having no \(K_5\) minor
- Dynamic coloring parameters for graphs with given genus
- Dynamic list coloring of bipartite graphs
- Dynamic proper colorings of a graph
- Element deletion changes in dynamic coloring of graphs
- Graph theory
- Graphs with maximum degree 17 and maximum average degree less than 3 are list 2-distance ( +2)-colorable
- Hedetniemi's conjecture---a survey
- scientific article; zbMATH DE number 6383853 (Why is no real title available?)
- scientific article; zbMATH DE number 5901911 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3265667 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3308991 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- Hypergraph colouring and the Lovász local lemma
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- List 2-distance coloring of planar graphs without short cycles
- List 2-facial 5-colorability of plane graphs with girth at least 12
- List 3-dynamic coloring of graphs with small maximum average degree
- List r-dynamic coloring of graphs with small maximum average degree
- List \(r\)-dynamic coloring of sparse graphs
- List r-hued chromatic number of graphs with bounded maximum average degrees
- List coloring of graphs having cycles of length divisible by a given number
- List Colouring Squares of Planar Graphs
- List Dynamic Coloring of Sparse Graphs
- List-Coloring Squares of Sparse Subcubic Graphs
- List-coloring the square of a subcubic graph
- List-colouring the square of a \(K_4\)-minor-free graph
- List-colouring the square of an outerplanar graph.
- Minimum 2-distance coloring of planar graphs and channel assignment
- On 3-hued coloring of graphs
- On \(r\)-dynamic chromatic number of graphs
- On \(r\)-dynamic coloring of graphs
- On \(r\)-dynamic coloring of grids
- On r-hued coloring of K₄-minor free graphs
- On r-hued coloring of planar graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On \(r\)-hued colorings of graphs without short induced paths
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- On dynamic coloring of certain cycle-related graphs
- On list 3-dynamic coloring of near-triangulations
- On list r-hued coloring of planar graphs
- On Moore Graphs with Diameters 2 and 3
- On the r-dynamic coloring of the direct product of a path with either a path or a cycle
- On the difference between chromatic number and dynamic chromatic number of graphs
- On the dynamic coloring of Cartesian product graphs
- On the dynamic coloring of graphs
- On the list dynamic coloring of graphs
- Planar graphs of girth at least five are square ( + 2)-choosable
- Several sufficient conditions of a normal graph in conditional coloring
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- The 2nd-order conditional 3-coloring of claw-free graphs
- The distance coloring of graphs
- The dynamic coloring numbers of pseudo-Halin graphs
- The list 2-distance coloring of a graph with (G)=5
- The square of a planar cubic graph is 7-colorable
- Three short proofs in graph theory
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- Upper bounds of r-hued colorings of planar graphs
- Vertex coloring the square of outerplanar graphs of low degree
- Über eine Eigenschaft der ebenen Komplexe
Cited in
(24)- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
- On list \(r\)-hued coloring of outer-1-planar graphs
- Brooks-type theorem for \(r\)-hued coloring of graphs
- r-hued coloring of Cartesian product of path with its square
- Weak-dynamic coloring of graphs beyond-planarity
- Optimal secret share distribution in degree splitting communication networks
- On r-hued coloring of product graphs
- The list \(r\)-hued coloring of \(K_{m, n}\)
- On r-hued coloring of corona product of some graphs
- List dynamic 4-coloring of planar graphs
- 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
- The list r-hued coloring of P₅-free graph
- The list r-hued coloring of Halin graph
- The r-hued coloring of K₄ (7)-minor free graphs
- Dynamic coloring of IC-planar graphs
- r-dynamic colorings and the spectral radius in graphs
- On r-hued coloring of connected P₅-free tripartite graphs
- 3-IC planar graphs are dynamically 9-choosable
- The list r-hued coloring of bicyclic graphs
- Brooks-type theorem for r-frugal coloring of graphs
- Improved bounds of r-hued colorings of planar graphs
This page was built for publication: Graph \(r\)-hued colorings -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172387)
