Deeply asymmetric planar graphs

DOI10.1016/J.JCTB.2005.03.002MaRDI QIDQ2565687zbMATH OpenOpenAlexFDO

Authors V. A. Aksionov, Oleg V. Borodin, G. Sabidussi, Michael Stiebitz, Leonid S. Mel'nikov, Bjarne Toft

Publication date 28 September 2005

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

Full work available at URL https://doi.org/10.1016/j.jctb.2005.03.002

zbMATH Keywords

DischargingAsymmetry

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On strongly asymmetric graphs
• scientific article; zbMATH DE number 436072
• Asymmetric graphs
• Infinite families of asymmetric graphs
• scientific article; zbMATH DE number 3319301
• Planar Digraphs
• Planar hypohamiltonian oriented graphs
• Minimal asymmetric graphs
• On almost-planar graphs
• scientific article; zbMATH DE number 4154462

Cites work

• Asymmetric graphs
• Joint extension of two theorems of Kotzig on 3-polytopes

Cited in

(6)

• Invariant systems of representatives, or the cost of symmetry
• Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• A bounded search tree algorithm for parameterized face cover
• An extension of Kotzig's theorem
• Paley and the Paley Graphs

This page was built for publication: Deeply asymmetric planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565687)