Pages that link to "Item:Q1136777"
From MaRDI portal
The following pages link to Some perfect coloring properties of graphs (Q1136777):
Displayed 25 items.
- Total dominating sequences in graphs (Q267175) (← links)
- First-fit chromatic numbers of \(d\)-degenerate graphs (Q427876) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- Iterated colorings of graphs. (Q1427472) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On partial Grundy coloring of bipartite graphs and chordal graphs (Q2009016) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- The Hadwiger number, chordal graphs and \(ab\)-perfection (Q2409752) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- An algorithm for partial Grundy number on trees (Q2576842) (← links)
- Grundy coloring for power graphs (Q3439033) (← links)
- A note on strong perfectness of graphs (Q3714102) (← links)
- On Computational Aspects of Greedy Partitioning of Graphs (Q4632201) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)