On unretractive graphs

DOI10.1016/j.disc.2008.11.039zbMath1210.05127MaRDI QIDQ5902333

Roland Kaschek

Publication date: 15 December 2009

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

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

zbMATH Keywords

core; endomorphism; wreath product; finite graph; lexicographic product; unretractive

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

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

Related Items

On wreathed lexicographic products of graphs

Cites Work

• Endomorphism spectra of graphs
• On the group of the composition of two graphs
• The composition of graphs
• Graph derivatives
• Wreath products of monoids with small categories whose principal one- sided ideals form trees
• 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
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Unretractive and S-unretractive joins and lexicographic products of graphs
• Some Applications of the Wreath Product Construction
• Handbook of Graph Theory
• The independent resolving number of a graph
• The group of an X-join of graphs
• On the groups of repeated graphs
• The lexicographic product of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item