✦ LIBER ✦

Cubic graphs with crossing number two

✍ Scribed by Bruce Richter

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 360 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numbers of cubic graphs

✍ R. W. Robinson; N. C. Wormald 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract The numbers of unlabeled cubic graphs on __p = 2n__ points have been found by two different counting methods, the best of which has given values for __p ≦__ 40.

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.

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

Domination number of cubic graphs with l

Domination number of cubic graphs with large girth

✍ Daniel Král'; Petr Škoda; Jan Volec 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n+O(n / g) < 3n / 10+O(n / g) This research was done when the Petr Škoda was a student of

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

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