๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Forbidden subgraphs for graphs with planar line graphs

โœ Scribed by D.L. Greenwell; Robert L. Hemminger

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
355 KB
Volume
2
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On planar intersection graphs with forbi
On planar intersection graphs with forbidden subgraphs
โœ Jรกnos Pach; Micha Sharir ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

Line Graphs and Forbidden Induced Subgra
Line Graphs and Forbidden Induced Subgraphs
โœ Hong-Jian Lai; ฤฝubomฤฑ́r ล oltรฉs ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, S8 olte s gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases. A graph is said to be a dumbbell if it con

Graphs isomorphic to subgraphs of their
Graphs isomorphic to subgraphs of their line-graphs
โœ Douglas Bauer; Ralph Tindell ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 621 KB

## An emhdding of graph G into graph N is by definition an isomorphism OI G onto a subgraph of H. It is shown in this paper that every unicycle V embeds in its line-graph L(V), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle