✦ LIBER ✦

On Line Graphs with Crossing Number 1

✍ Scribed by V. R. Kulli; D. G. Akka; L. W. Beineke

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 159 KB
Volume: 3
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190030109

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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

Cubic graphs with crossing number two

✍ Bruce Richter 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

Minimal Graphs with Crossing Number at L

Minimal Graphs with Crossing Number at Least k

✍ R.B. Richter; C. Thomassen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Infinite families of crossing-critical g

Infinite families of crossing-critical graphs with prescribed average degree and crossing number

✍ Drago Bokal 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB 👁 1 views

## Abstract Širáň constructed infinite families of __k__‐crossing‐critical graphs for every __k__⩾3 and Kochol constructed such families of simple graphs for every __k__⩾2. Richter and Thomassen argued that, for any given __k__⩾1 and __r__⩾6, there are only finitely many simple __k__‐crossing‐criti

On 3-regular graphs having crossing numb

On 3-regular graphs having crossing number at least 2

✍ Dan McQuillan; R. Bruce Richter 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB

## Abstract We give a planar proof of the fact that if __G__ is a 3‐regular graph minimal with respect to having crossing number at least 2, then the crossing number of __G__ is 2.

On graphs with linear Ramsey numbers

✍ R. L. Graham; V. Rödl; A. Ruciński 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views