Minimal asymmetric graphs of induced length 4

DOI10.1007/BF02351591zbMath0778.05044OpenAlexW2006645382MaRDI QIDQ1205345

Gert Sabidussi, Jaroslav Nešetřil

Publication date: 1 April 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02351591

zbMATH Keywords

minimal asymmetric graphsminimal involution-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (3)

Minimal asymmetric graphs ⋮ Minimal asymmetric hypergraphs ⋮ A surprising permanence of old motivations (a not-so-rigid story)

Cites Work

• Clumps, minimal asymmetric graphs, and involutions
• A Homomorphism Theorem for Finite Graphs
• Graphs with unique maximal clumpings
• Paths in bipartite graphs with color‐inverting involutions

This page was built for publication: Minimal asymmetric graphs of induced length 4