✦ LIBER ✦

Forbidden subgraphs for graphs with line graphs of crossing number ≤1

✍ Scribed by D. G. Akka; S. V. Panshetty

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 403 KB
Volume: 26
Category: Article
ISSN: 0031-5303
DOI: 10.1007/bf01875970

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden subgraphs for graphs with plan

Forbidden subgraphs for graphs with planar line graphs

✍ D.L. Greenwell; Robert L. Hemminger 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Forbidden induced subgraphs for line gra

Forbidden induced subgraphs for line graphs

✍ Ľubomír Šoltés 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 209 KB

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.

Automorphism groups of graphs with forbi

Automorphism groups of graphs with forbidden subgraphs

✍ Gerhard Behrendt 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 207 KB

On the chromatic number of a graph with

On the chromatic number of a graph with two forbidden subgraphs

✍ Medha Dhurandhar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Traceability in graphs with forbidden tr

Traceability in graphs with forbidden triples of subgraphs

✍ Ronald J. Gould; John M. Harris 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 724 KB

If 9 is a collection of connected graphs, and if a graph G does not contain any member of 9 as an induced subgraph, then G is said to be F-free. The members of f in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of tr