𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Crossing Number of Complete Graphs

✍ Scribed by O. Aichholzer; F. Aurenhammer; H. Krasser

Publisher
Springer Vienna
Year
2005
Tongue
English
Weight
135 KB
Volume
76
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs whose line graphs have crossin
On graphs whose line graphs have crossing number one
✍ Stanislav Jendrol'; MariΓ‘n KlesΜ†cΜ† πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

## Abstract Necessary and sufficient conditions are given for a nonplanar graph to have a line graph with crossing number one. This corrects some errors in Kulli et al. 4. Β© 2001 John Wiley & Sons, Inc. J Graph Theory 37: 181–188, 2001

On the number of triangular embeddings o
On the number of triangular embeddings of complete graphs and complete tripartite graphs
✍ M. J. Grannell; M. Knor πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__β†’βˆž, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__Β·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many

On Line Graphs with Crossing Number 1
On Line Graphs with Crossing Number 1
✍ V. R. Kulli; D. G. Akka; L. W. Beineke πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

## Abstract In this paper we deduce a necessary and sufficient condition for a line grah to have crossing number 1. In addition, we prove that the line graph of any nonplanar graph has crossing number greater than 2.