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
Cites work
- scientific article; zbMATH DE number 3739563 (Why is no real title available?)
- scientific article; zbMATH DE number 3616459 (Why is no real title available?)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
- Cartesian graph factorization at logarithmic cost per edge
- Factoring a graph in polynomial time
- Finding the prime factors of strong direct product graphs in polynomial time
- Kneser's conjecture, chromatic number, and homotopy
- Retracts of strong products of graphs
- Two remarks on retracts of graph products
- n-tuple colorings and associated graphs
Cited in
(10)- Colouring strong products
- Strong product of factor-critical graphs
- Retracts of strong products of graphs
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Two remarks on retracts of graph products
- The subset-strong product of graphs
- Coloring graph products---a survey
- Acyclic coloring of products of digraphs
- Strong products of \(\chi\)-critical graphs
- Families of strongly projective graphs
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)
