#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1977

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- V. A. Aksionov
- Discrete Mathematics
- 1977

A k-chromatic graph G is called uniquely k-colorable if every k-coloring of the vertex set V of G induces the same partition of V into k color classes. There is an innnite class C of uniquely 4-colorable planar graphs obtained from the K 4 by repeatedly inserting new vertices of degree 3 in triangular faces. In this paper we are concerned with the… (More)

- V. A. Aksionov, Leonid S. Melnikov
- J. Comb. Theory, Ser. B
- 1980

- V. A. Aksionov, Oleg V. Borodin, Leonid S. Melnikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
- J. Comb. Theory, Ser. B
- 2005

It is proved that by deleting at most 5 edges every planar graph can be reduced to a graph having a non-trivial automorphism. Moreover, the bound of 5 edges cannot be lowered to 4.

- ‹
- 1
- ›