Title of article
Deeply asymmetric planar graphs
Author/Authors
Aksionov، نويسنده , , V.A. and Borodin، نويسنده , , O.V. and Mel’nikov، نويسنده , , L.S. and Sabidussi، نويسنده , , G. and Stiebitz، نويسنده , , M. Blichert-Toft، نويسنده , , B.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
11
From page
68
To page
78
Abstract
It is proved that by deleting at most 5 edges every planar (simple) graph of order at least 2 can be reduced to a graph having a non-trivial automorphism. Moreover, the bound of 5 edges cannot be lowered to 4.
Keywords
Planar graphs , Asymmetry , Discharging
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2005
Journal title
Journal of Combinatorial Theory Series B
Record number
1527597
Link To Document