On wreathed lexicographic products of graphs

DOI10.1016/j.disc.2009.10.021zbMath1195.05064OpenAlexW2087884415MaRDI QIDQ965985

Roland Kaschek

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.021

zbMATH Keywords

endomorphismwreath productfinite graphlexicographic product

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Semigroup theory of symmetry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphism spectra of graphs
• On the group of the composition of two graphs
• The composition of graphs
• Parallel concepts in graph theory
• Wreath products of monoids with small categories whose principal one- sided ideals form trees
• Improved bounds for the chromatic number of the lexicographic product of graphs
• Endomorphisms of graphs. I: The monoid of strong endomorphisms
• Endomorphisms of graphs. II: Various unretractive graphs
• Graphs with a regular endomorphism monoid
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Errate. The lexicographic product of graphs
• Unretractive and S-unretractive joins and lexicographic products of graphs
• Some Applications of the Wreath Product Construction
• Handbook of Graph Theory
• The group of an X-join of graphs
• On the groups of repeated graphs
• On unretractive graphs
• The lexicographic product of graphs

This page was built for publication: On wreathed lexicographic products of graphs