Strong products of Kneser graphs
From MaRDI portal
Publication:1336712
DOI10.1016/0012-365X(94)90037-XzbMATH Open0811.05026OpenAlexW1986922252MaRDI QIDQ1336712FDOQ1336712
Authors: 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
Recommendations
- scientific article; zbMATH DE number 917749
- Strongly perfect products of graphs
- Note on strong product of graphs
- Grundy numbers of strong products of graphs
- Total $k$-domination in strong product graphs
- Strong product of factor-critical graphs
- Connectivity of strong products of graphs
- Publication:4865480
- Pancyclicity of strong products of graphs
- Strong products of \(\chi\)-critical graphs
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Cartesian graph factorization at logarithmic cost per edge
- Finding the prime factors of strong direct product graphs in polynomial time
- n-tuple colorings and associated graphs
- Retracts of strong products of graphs
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Factoring a graph in polynomial time
- Title not available (Why is that?)
- Two remarks on retracts of graph products
- Title not available (Why is that?)
Cited In (10)
- Strong product of factor-critical graphs
- Two remarks on retracts of graph products
- The subset-strong product of graphs
- Strong products of \(\chi\)-critical graphs
- Colouring strong products
- Retracts of strong products of graphs
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Families of strongly projective graphs
- Coloring graph products---a survey
- Acyclic coloring of products of digraphs
This page was built for publication: Strong products of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336712)