Independence ratios of graph powers
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- Measure preserving homomorphisms and independent sets in tensor graph powers
- A fixed box theorem for the cartesian product of graphs and metric spaces
- On the independence graph of a graph
- On the ultimate independence ratio of a graph
- On the ultimate normalized chromatic difference sequence of a graph
- Star-extremal graphs and the lexicographic product
- On the bounds for the ultimate independence ratio of a graph
- Coloring graphs by translates in the circle
- Graphs with a unique maximum independent set up to automorphisms
- Linear-time algorithms for tree root problems
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Asymptotic values of the Hall-ratio for graph powers
- On independent domination in direct products
- Independent sets in tensor graph powers
- Bipartite density and the independence ratio
- Star chromatic numbers and products of graphs
- scientific article; zbMATH DE number 1787227 (Why is no real title available?)
- Complexity results on \(k\)-independence in some graph products
- On the independence graph of Hamming graph
This page was built for publication: Independence ratios of graph powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322230)