On the ultimate normalized chromatic difference sequence of a graph
From MaRDI portal
Publication:1910556
DOI10.1016/0012-365X(94)00244-DzbMath0847.05055MaRDI QIDQ1910556
Publication date: 24 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00244-d
05C35: Extremal problems in graph theory
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Cites Work
- Unnamed Item
- The chromatic difference sequence of the Cartesian product of graphs
- Homomorphisms of 3-chromatic graphs
- The chromatic difference sequence of a graph
- Independence ratios of graph powers
- On the ultimate independence ratio of a graph
- On the bounds for the ultimate independence ratio of a graph
- Chromatic difference sequences and homomorphisms
- A note on the star chromatic number
- Star chromatic number
- Analogues of the Shannon Capacity of a Graph
- On the Shannon capacity of a graph