Some perfect coloring properties of graphs
From MaRDI portal
Cites work
Cited in
(57)- The b-chromatic number of a graph
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Iterated colorings of graphs.
- On the performance guarantee of first fit for sum coloring
- Dynamic \(F\)-free coloring of graphs
- Recoloring graphs via tree decompositions
- Computational aspects of greedy partitioning of graphs
- On partial Grundy coloring of bipartite graphs and chordal graphs
- Transitivity on subclasses of bipartite graphs
- The digrundy number of digraphs
- \(b\)-continuity and partial Grundy coloring of graphs with large girth
- Grundy coloring in some subclasses of bipartite graphs and their complements
- New potential functions for greedy independence and coloring
- Complexity of modification problems for reciprocal best match graphs
- The Hadwiger number, chordal graphs and \(ab\)-perfection
- On the Grundy number of Cameron graphs
- An algorithm for partial Grundy number on trees
- Total dominating sequences in graphs
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs
- On b-acyclic chromatic number of a graph
- Decremental optimization of vertex-coloring under the reconfiguration framework
- Grundy Coloring and friends, half-graphs, bicliques
- Grundy coloring for power graphs
- A note on strong perfectness of graphs
- First-fit chromatic numbers of \(d\)-degenerate graphs
- On Computational Aspects of Greedy Partitioning of Graphs
- Minimum order of graphs with given coloring parameters
- A new characterization of trivially perfect graphs
- Hierarchical and modularly-minimal vertex colorings
- Grundy Distinguishes Treewidth from Pathwidth
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- More bounds for the Grundy number of graphs
- My top 10 graph theory conjectures and open problems
- Grundy distinguishes treewidth from pathwidth
- On 3-coloring of \((2P_4,C_5)\)-free graphs
- On 3-coloring of \((2P_4,C_5)\)-free graphs
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- A survey on the Intersection graphs of ideals of rings
- Transitivity on subclasses of chordal graphs
- Grundy number of corona product of some graphs
- Results on Grundy chromatic number of join graph of graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
- Algorithmic study on 2-transitivity of graphs
- Sprague-Grundy functions for certain infinite acyclic graphs
- The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
- On complementarily transitivity of graphs
- Tournament transitivity of graphs
- Transitivity in some graph-classes
- Strong transitivity of a graph
- Fast FPT algorithms for Grundy number on dense graphs
- \(\mathcal{O}(VE)\) time algorithms for the Grundy (first-fit) chromatic number of block graphs and graphs with large girth
- Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
- A simplified graph parameter and its relationship to the modified Randić index
- Parameterized saga of first-fit and last-fit coloring
- Connected greedy coloring of H-free graphs
- Results on the Grundy chromatic number of graphs
This page was built for publication: Some perfect coloring properties of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1136777)
