Two remarks on retracts of graph products

DOI10.1016/0012-365X(92)90286-OMaRDI QIDQ686296zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar

Publication date 14 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphchromatic numberstrong producttrianglesCartesian productretractfactorMycielski graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• Retracts of strong products of graphs
• Strong products of Kneser graphs
• Hedetniemi's conjecture and the retracts of a product of graphs
• Retract rigid Cartesian products of graphs
• Strong products of \(\chi\)-critical graphs

Cites work

• scientific article; zbMATH DE number 3616459 (Why is no real title available?)
• Absolute Retracts and Varieties of Reflexive Graphs
• Retract rigid Cartesian products of graphs
• Retracts of strong products of graphs
• Sur le coloriage des graphs

Cited in

(12)

• Representation of Connected Monounary Algebras by Means of Irreducibles
• On chaotic Cartesian product of graphs and their retractions
• Retract rigid Cartesian products of graphs
• Strong products of Kneser graphs
• Retracts of strong products of graphs
• On the chromatic number of the lexicographic product and the Cartesian sum of graphs
• Retracts of products of chordal graphs
• Coloring graph products---a survey
• Odd-angulated graphs and cancelling factors in box products
• The chromatic numbers of graph bundles over cycles
• Strong products of \(\chi\)-critical graphs
• scientific article; zbMATH DE number 1053104 (Why is no real title available?)

This page was built for publication: Two remarks on retracts of graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686296)