A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product

DOI10.1016/j.disc.2007.12.065zbMath1210.05126OpenAlexW2163131595WikidataQ122901009 ScholiaQ122901009MaRDI QIDQ5902101

Pierre Ille

Publication date: 19 June 2009

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

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

zbMATH Keywords

idempotentwreath productlexicographic product

Mathematics Subject Classification ID

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

Related Items (1)

Convex sets in lexicographic products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of relations. Transl. from the French by P. Clote
• Graph derivatives
• Indecomposable graphs
• Transitiv orientierbare Graphen
• The group of an X-join of graphs
• The lexicographic product of graphs

This page was built for publication: A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product