Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.jctb.2005.03.002 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
planar graphs,asymmetry,non-trivial automorphism,discharging,asymmetric planar graph,planar graph | Discrete mathematics,Combinatorics,Outerplanar graph,Planar straight-line graph,Polyhedral graph,Cycle graph,Book embedding,Graph minor,Multiple edges,Planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
95 | 1 | Journal of Combinatorial Theory, Series B |
Citations | PageRank | References |
2 | 0.41 | 1 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V. A. Aksionov | 1 | 2 | 0.41 |
| O. V. Borodin | 2 | 2 | 0.41 |
| L. S. Mel'nikov | 3 | 2 | 0.75 |
| G. Sabidussi | 4 | 8 | 2.32 |
| M. Stiebitz | 5 | 107 | 12.98 |
| B. Toft | 6 | 2 | 0.75 |