Some perfect coloring properties of graphs
From MaRDI portal
Publication:1136777
DOI10.1016/0095-8956(79)90067-4zbMath0427.05033WikidataQ56474997 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 number; achromatic number; infinite graphs; locally finite graphs; Grundy number; maximum clique size; denumerable graphs; Grundy coloring
05C15: Coloring of graphs and hypergraphs
Related Items
On Computational Aspects of Greedy Partitioning of Graphs, 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, My Top 10 Graph Theory Conjectures and Open Problems, Unnamed Item, 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, Transitivity on subclasses of chordal graphs, Grundy number of corona product of some graphs, A survey on the Intersection graphs of ideals of rings, Total dominating sequences in graphs, First-fit chromatic numbers of \(d\)-degenerate graphs, Minimum order of graphs with given coloring parameters, More bounds for the Grundy number of graphs, Connected greedy coloring of \(H\)-free graphs, Results on the Grundy chromatic number of graphs, 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, Complexity of Grundy coloring and its variants, 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, 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
Cites Work
