Minimal asymmetric graphs

DOI10.1016/J.JCTB.2017.06.003zbMath1371.05131arXiv1605.01320OpenAlexW2962906030MaRDI QIDQ2407386

Patrick Schweitzer, Pascal Schweitzer

Publication date: 29 September 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.01320

zbMATH Keywords

characterizationautomorphismsasymmetric graphsinvolution-free graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (2)

Minimal asymmetric hypergraphs ⋮ On the distinguishing number of functigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• A surprising permanence of old motivations (a not-so-rigid story)
• Complement reducible graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Minimal asymmetric graphs of induced length 4
• Clumps, minimal asymmetric graphs, and involutions
• A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
• Algorithmic graph theory and perfect graphs
• A congruence theorem for asymmetric trees
• Some classes of perfectly orderable graphs
• Asymmetric graphs
• Dominating cliques in graphs

This page was built for publication: Minimal asymmetric graphs