Almost all graphs are rigid-revisited

DOI10.1016/j.disc.2008.11.031zbMath1200.05102OpenAlexW2175403806MaRDI QIDQ1044909

Jens Kötters

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.031

zbMATH Keywords

rigid graphsalmost all graphsunretractive graphs

Mathematics Subject Classification ID

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

Cites Work

• On the minimum order of graphs with given semigroup
• Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers
• Symmetric relations (undirected graphs) with given semigroups
• On Rigid Undirected Graphs
• Asymmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Almost all graphs are rigid-revisited