Strong products of Kneser graphs
From MaRDI portal
Publication:1336712
DOI10.1016/0012-365X(94)90037-XzbMath0811.05026OpenAlexW1986922252MaRDI QIDQ1336712
Sandi Klavžar, Uroš Milutinović
Publication date: 18 April 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)90037-x
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
On the chromatic number of the lexicographic product and the Cartesian sum of graphs ⋮ Coloring graph products---a survey ⋮ Acyclic coloring of products of digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Factoring a graph in polynomial time
- Finding the prime factors of strong direct product graphs in polynomial time
- Retracts of strong products of graphs
- Two remarks on retracts of graph products
- Kneser's conjecture, chromatic number, and homotopy
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Cartesian graph factorization at logarithmic cost per edge
- n-tuple colorings and associated graphs
This page was built for publication: Strong products of Kneser graphs