The chromatic difference sequence of a graph

DOI10.1016/0095-8956(80)90040-4MaRDI QIDQ1246543zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 3014822 (Why is no real title available?)
• Some partitions associated with a partially ordered set
• The structure of Sperner k-families

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1246543)