Conditional colorings of graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(55)- Complexity of conditional colorability of graphs
- On list r-hued coloring of planar graphs
- List r-hued chromatic number of graphs with bounded maximum average degrees
- List r-dynamic coloring of graphs with small maximum average degree
- Upper bounds of r-hued colorings of planar graphs
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- Conditional chromatic numbers with forbidden cycles
- Degree tolerant coloring of graph
- 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
- Decomposition and r-hued coloring of K₄(7)-minor free graphs
- List \(r\)-dynamic coloring of sparse graphs
- On \(r\)-hued colorings of graphs without short induced paths
- Optimal \(r\)-dynamic coloring of sparse graphs
- On defected colourings of graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Element deletion changes in dynamic coloring of graphs
- Dynamic coloring of graphs having no \(K_5\) minor
- Several sufficient conditions of a normal graph in conditional coloring
- scientific article; zbMATH DE number 4177084 (Why is no real title available?)
- scientific article; zbMATH DE number 3885934 (Why is no real title available?)
- Generalized chromatic numbers of graphs with bipartite complements
- scientific article; zbMATH DE number 3979083 (Why is no real title available?)
- scientific article; zbMATH DE number 1185595 (Why is no real title available?)
- On r-hued coloring of K₄-minor free graphs
- On dynamic coloring for planar graphs and graphs of higher genus
- On the difference between chromatic number and dynamic chromatic number of graphs
- Linear list r-hued coloring of sparse graphs
- On the \(r\)-dynamic coloring of the direct product of a path and a \(k\)-subdivision of a star graph
- Weak-dynamic coloring of graphs beyond-planarity
- On the dynamic coloring of graphs
- 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}\)
- List dynamic 4-coloring of planar graphs
- List 3-dynamic colorings of planar graphs
- Upper bound of the list r-hued chromatic number
- 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
- On r-dynamic k-coloring of ladder graph families
- Solving the dynamic coloring problem for direct products of paths with fan graphs
- On r-hued coloring of connected P₅-free tripartite graphs
- Dynamic chromatic number of regular graphs
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- 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
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- On \(r\)-hued coloring of planar graphs with girth at least 6
- The 2nd-order conditional 3-coloring of claw-free graphs
- On the list dynamic coloring of graphs
This page was built for publication: Conditional colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501581)
