Some perfect coloring properties of graphs

DOI10.1016/0095-8956(79)90067-4MaRDI QIDQ1136777zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Claude A. Christen, Stanley 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

zbMATH Keywords

chromatic numberGrundy numberinfinite graphslocally finite graphsachromatic numbermaximum clique sizedenumerable graphsGrundy coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3298599 (Why is no real title available?)
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• On a property of the class of n-colorable graphs

Cited in

(47)

• Transitivity on subclasses of chordal graphs
• Total dominating sequences in graphs
• Transitivity on subclasses of bipartite graphs
• Grundy Coloring and friends, half-graphs, bicliques
• On the Grundy number of Cameron graphs
• Grundy Distinguishes Treewidth from Pathwidth
• Algorithmic study of \(d_2\)-transitivity of graphs
• The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
• On partial Grundy coloring of bipartite graphs and chordal graphs
• First-fit chromatic numbers of \(d\)-degenerate graphs
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• On the performance guarantee of first fit for sum coloring
• Iterated colorings of graphs.
• An algorithm for partial Grundy number on trees
• A survey on the Intersection graphs of ideals of rings
• Dynamic \(F\)-free coloring of graphs
• Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
• Results on the Grundy chromatic number of graphs
• Computational aspects of greedy partitioning of graphs
• The b-chromatic number of a graph
• The digrundy number of digraphs
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Algorithmic study on 2-transitivity of graphs
• On Computational Aspects of Greedy Partitioning of Graphs
• Grundy number of corona product of some graphs
• Sprague-Grundy functions for certain infinite acyclic graphs
• A new characterization of trivially perfect graphs
• Complexity of modification problems for reciprocal best match graphs
• Grundy distinguishes treewidth from pathwidth
• Minimum order of graphs with given coloring parameters
• Connected greedy coloring of H-free graphs
• Generalising the achromatic number to Zaslavsky's colourings of signed graphs
• A note on strong perfectness of graphs
• Results on Grundy chromatic number of join graph of graphs
• Recoloring graphs via tree decompositions
• New potential functions for greedy independence and coloring
• On 3-coloring of \((2P_4,C_5)\)-free graphs
• On 3-coloring of \((2P_4,C_5)\)-free graphs
• Grundy coloring in some subclasses of bipartite graphs and their complements
• On b-acyclic chromatic number of a graph
• Hierarchical and modularly-minimal vertex colorings
• The Hadwiger number, chordal graphs and \(ab\)-perfection
• \(b\)-continuity and partial Grundy coloring of graphs with large girth
• Decremental optimization of vertex-coloring under the reconfiguration framework
• More bounds for the Grundy number of graphs
• Grundy coloring for power graphs
• My top 10 graph theory conjectures and open problems

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)