Two remarks on retracts of graph products

DOI10.1016/0012-365X(92)90286-OzbMath0780.05055OpenAlexW2168202945MaRDI QIDQ686296

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 numberCartesian productMycielski graphfactorstrong productretracttriangles

Mathematics Subject Classification ID

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

Related Items (9)

Strong products of Kneser graphs ⋮ On the chromatic number of the lexicographic product and the Cartesian sum of graphs ⋮ Coloring graph products---a survey ⋮ Odd-angulated graphs and cancelling factors in box products ⋮ Retracts of strong products of graphs ⋮ Representation of Connected Monounary Algebras by Means of Irreducibles ⋮ Strong products of \(\chi\)-critical graphs ⋮ The chromatic numbers of graph bundles over cycles ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Retracts of strong products of graphs
• Retract rigid Cartesian products of graphs
• Absolute Retracts and Varieties of Reflexive Graphs
• Sur le coloriage des graphs

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