Some perfect coloring properties of graphs
From MaRDI portal
Publication:1136777
DOI10.1016/0095-8956(79)90067-4zbMath0427.05033DBLPjournals/jct/ChristenS79OpenAlexW2019615117WikidataQ56474997 ScholiaQ56474997MaRDI QIDQ1136777
Claude A. Christen, Stanley M. Selkow
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90067-4
chromatic numberachromatic numberinfinite graphslocally finite graphsGrundy numbermaximum clique sizedenumerable graphsGrundy coloring
Related Items (43)
Total dominating sequences in graphs ⋮ On the performance guarantee of first fit for sum coloring ⋮ A note on strong perfectness of graphs ⋮ Dynamic \(F\)-free coloring of graphs ⋮ The digrundy number of digraphs ⋮ Hierarchical and modularly-minimal vertex colorings ⋮ Results on the Grundy chromatic number of graphs ⋮ The Hadwiger number, chordal graphs and \(ab\)-perfection ⋮ On the Grundy number of Cameron graphs ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Generalising the achromatic number to Zaslavsky's colourings of signed graphs ⋮ The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ Recoloring graphs via tree decompositions ⋮ Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ Transitivity on subclasses of chordal graphs ⋮ On b-acyclic chromatic number of a graph ⋮ Unnamed Item ⋮ Grundy number of corona product of some graphs ⋮ First-fit chromatic numbers of \(d\)-degenerate graphs ⋮ Computational aspects of greedy partitioning of graphs ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ Decremental optimization of vertex-coloring under the reconfiguration framework ⋮ On the equality of the partial Grundy and upper ochromatic numbers of graphs ⋮ Grundy Coloring and friends, half-graphs, bicliques ⋮ Iterated colorings of graphs. ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ More bounds for the Grundy number of graphs ⋮ A survey on the Intersection graphs of ideals of rings ⋮ Complexity of Grundy coloring and its variants ⋮ New potential functions for greedy independence and coloring ⋮ On partial Grundy coloring of bipartite graphs and chordal graphs ⋮ Complexity of modification problems for reciprocal best match graphs ⋮ On 3-coloring of \((2P_4,C_5)\)-free graphs ⋮ On 3-coloring of \((2P_4,C_5)\)-free graphs ⋮ The b-chromatic number of a graph ⋮ Connected greedy coloring of \(H\)-free graphs ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ A new characterization of trivially perfect graphs ⋮ An algorithm for partial Grundy number on trees ⋮ Transitivity on subclasses of bipartite graphs ⋮ Grundy coloring for power graphs
Cites Work
This page was built for publication: Some perfect coloring properties of graphs
