The chromatic difference sequence of a graph

DOI10.1016/0095-8956(80)90040-4zbMath0377.05020OpenAlexW1999943825MaRDI QIDQ1246543

Michael O. Albertson, David M. Berman

Publication date: 1980

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(80)90040-4

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Chromatic difference sequences and homomorphisms ⋮ On the ultimate independence ratio of a graph ⋮ On the ultimate normalized chromatic difference sequence of a graph ⋮ Partial DP-coloring of graphs ⋮ The edge chromatic difference sequence of a cubic graph ⋮ On the bounds for the ultimate independence ratio of a graph ⋮ Critical graphs for chromatic difference sequences ⋮ The chromatic difference sequence of the Cartesian product of graphs. II ⋮ Homomorphisms of 3-chromatic graphs ⋮ The chromatic difference sequence of the Cartesian product of graphs ⋮ Some sequences associated with combinatorial structures

Cites Work

• Some partitions associated with a partially ordered set
• The structure of Sperner k-families
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromatic difference sequence of a graph