Independence ratios of graph powers

DOI10.1016/0012-365X(92)00480-FzbMath0795.05054OpenAlexW2008495201MaRDI QIDQ1322230

Xingxing Yu, Hui Shan Zhou, Pavol Hell

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00480-f

zbMATH Keywords

independence numberchromatic numberlimitcartesian productindependence ratiocartesian powers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Graphs with a unique maximum independent set up to automorphisms ⋮ On the ultimate independence ratio of a graph ⋮ A fixed box theorem for the cartesian product of graphs and metric spaces ⋮ On the ultimate normalized chromatic difference sequence of a graph ⋮ Star-extremal graphs and the lexicographic product ⋮ Star chromatic numbers and products of graphs ⋮ On the bounds for the ultimate independence ratio of a graph ⋮ On independent domination in direct products ⋮ Asymptotic values of the Hall-ratio for graph powers ⋮ On the independence graph of a graph ⋮ Coloring graphs by translates in the circle ⋮ Linear-time algorithms for tree root problems ⋮ On maximum independent set of categorical product and ultimate categorical ratios of graphs

Cites Work

• The chromatic difference sequence of the Cartesian product of graphs
• Homomorphisms of 3-chromatic graphs
• On the ultimate independence ratio of a graph
• On the bounds for the ultimate independence ratio of a graph
• A note on the star chromatic number

This page was built for publication: Independence ratios of graph powers