The following pages link to Conditional colorings of graphs (Q2501581):
Displaying 40 items.
- Element deletion changes in dynamic coloring of graphs (Q271647) (← links)
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165) (← links)
- On dynamic coloring for planar graphs and graphs of higher genus (Q423914) (← links)
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- On the dynamic coloring of graphs (Q617650) (← links)
- Dynamic chromatic number of regular graphs (Q713302) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- On \(r\)-hued coloring of planar graphs with girth at least 6 (Q897613) (← links)
- The 2nd-order conditional 3-coloring of claw-free graphs (Q924141) (← links)
- On the list dynamic coloring of graphs (Q967354) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- On list \(r\)-hued coloring of planar graphs (Q1680495) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- List \(r\)-dynamic coloring of graphs with small maximum average degree (Q1732119) (← links)
- Upper bounds of \(r\)-hued colorings of planar graphs (Q1752467) (← links)
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs (Q1786882) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- Degree tolerant coloring of graph (Q2061289) (← links)
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs (Q2065804) (← links)
- On the \(r\)-dynamic coloring of subdivision-edge coronas of a path (Q2129829) (← links)
- On the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph (Q2131554) (← links)
- On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle (Q2132214) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs (Q2189858) (← links)
- List \(r\)-dynamic coloring of sparse graphs (Q2309401) (← links)
- On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
- Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
- On defected colourings of graphs (Q2439252) (← links)
- Dynamic coloring and list dynamic coloring of planar graphs (Q2446867) (← links)
- (Q3220612) (← links)
- (Q3838403) (← links)
- Linear list r-hued coloring of sparse graphs (Q4577851) (← links)
- On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph (Q5866019) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- Optimal secret share distribution in degree splitting communication networks (Q6186165) (← links)
- On <i>r</i>-hued coloring of product graphs (Q6186548) (← links)
- The list \(r\)-hued coloring of \(K_{m, n}\) (Q6204299) (← links)
- List dynamic 4-coloring of planar graphs (Q6660058) (← links)
