𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring edges of self-complementary graphs

✍ Scribed by A.Paweł Wojda; Małgorzata Zwonek

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
362 KB
Volume
79
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the self-complementary graphs having cyclic complementing permutation are Class 1 and that the regular self-complementary graphs are Class 2. We conjecture that a selfcomplementary graph is Class 2 if and only if it is regular.

📜 SIMILAR VOLUMES

Coloring edges of embedded graphs
Coloring edges of embedded graphs
✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

In this paper, we prove that any graph G with maximum degree ÁG ! 11 p 49À241AEa2, which is embeddable in a surface AE of characteristic 1AE 1 and satis®es jVGj b 2ÁGÀ5À2 p 6ÁG, is class one.

Self-complementary graphs
Self-complementary graphs
✍ Richard A Gibbs 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 762 KB
Self-complementary graphs
Self-complementary graphs
✍ D. A. Suprunenko 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 728 KB
Simultaneous coloring of edges and faces
Simultaneous coloring of edges and faces of plane graphs
✍ Oleg V. Borodin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 888 KB

The edges and faces of a plane graph are colored so that every two adjacent or incident of them are colored differently. The minimal number of colors for this kind of coloring is estimated. For the plane graphs of the maximal degree at least 10, the bound is the best possible. The proof is based on

Self-complementary symmetric graphs
Self-complementary symmetric graphs
✍ Hong Zhang 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

## Abstract The class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.