Pages that link to "Item:Q1003864"
From MaRDI portal
The following pages link to Complexity of conditional colorability of graphs (Q1003864):
Displaying 31 items.
- Element deletion changes in dynamic coloring of graphs (Q271647) (← links)
- On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165) (← links)
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← 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)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- List \(r\)-hued chromatic number of graphs with bounded maximum average degrees (Q1709519) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← 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)
- \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs (Q2097109) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- On dynamic coloring of certain cycle-related graphs (Q2302720) (← links)
- \(r\)-Dynamic chromatic number of some line graphs (Q2322985) (← links)
- On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
- Conditional colorings of graphs (Q2501581) (← links)
- (Q3220612) (← links)
- Conditional Hardness for Approximate Coloring (Q3575151) (← links)
- (Q3766875) (← links)
- (Q4249529) (← links)
- Linear list r-hued coloring of sparse graphs (Q4577851) (← links)
- δ-Dynamic chromatic number of Helm graph families (Q4966761) (← links)
- (Q4984893) (← links)
- On r− dynamic coloring of the gear graph families (Q5027695) (← links)
- On \(r\)-dynamic coloring of the total graphs of gear graphs (Q5376964) (← links)
- On r- dynamic coloring of the family of bistar graphs (Q5865868) (← links)
- Dynamic coloring on restricted graph classes (Q6057319) (← links)
- Optimal secret share distribution in degree splitting communication networks (Q6186165) (← links)
- The list \(r\)-hued coloring of \(K_{m, n}\) (Q6204299) (← links)
