Deeply asymmetric planar graphs

DOI10.1016/j.jctb.2005.03.002zbMath1070.05031OpenAlexW2022616211MaRDI QIDQ2565687

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

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

AsymmetryDischarging

Mathematics Subject Classification ID

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

Related Items

An extension of Kotzig's theorem ⋮ Paley and the Paley 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 ⋮ Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs

Cites Work

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