On the bounds for the ultimate independence ratio of a graph
From MaRDI portal
Publication:1923515
DOI10.1016/0012-365X(93)E0171-YzbMath0857.05049MaRDI QIDQ1923515
Publication date: 7 October 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
fractional chromatic numberindependence numberindependent setstar chromatic numberCartesian productindependence ratioultimate independence
Related Items (6)
On the ultimate independence ratio of a graph ⋮ On the ultimate normalized chromatic difference sequence of a graph ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ Coloring graphs by translates in the circle ⋮ Adaptable chromatic number of graph products ⋮ Independence ratios of graph powers
Cites Work
- 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
- A note on the star chromatic number
- Star chromatic number
- Analogues of the Shannon Capacity of a Graph
- Star chromatic numbers and products of graphs
- On the Shannon capacity of a graph
- Unnamed Item
This page was built for publication: On the bounds for the ultimate independence ratio of a graph