Two remarks on retracts of graph products

DOI10.1016/0012-365X(92)90286-OzbMATH Open0780.05055OpenAlexW2168202945MaRDI QIDQ686296FDOQ686296

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)

Cites Work

• Sur le coloriage des graphs
• Retracts of strong products of graphs
• Absolute Retracts and Varieties of Reflexive Graphs
• Retract rigid Cartesian products of graphs
• Title not available (Why is that?)

Cited In (9)

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

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)