Pages that link to "Item:Q1136777"
From MaRDI portal
The following pages link to Some perfect coloring properties of graphs (Q1136777):
Displaying 42 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)
- Transitivity on subclasses of bipartite graphs (Q2104170) (← links)
- The digrundy number of digraphs (Q2142695) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← 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)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q2672623) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- Decremental optimization of vertex-coloring under the reconfiguration framework (Q2695300) (← links)
- Grundy Coloring and friends, half-graphs, bicliques (Q2700380) (← 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)
- A new characterization of trivially perfect graphs (Q5006549) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements (Q5099105) (← links)
- My Top 10 Graph Theory Conjectures and Open Problems (Q5506779) (← links)
- (Q5874480) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
- A survey on the Intersection graphs of ideals of rings (Q6101486) (← links)
- Grundy number of corona product of some graphs (Q6184224) (← links)
