✦ LIBER ✦

Outerplanarity of line graphs and iterated line graphs

✍ Scribed by Huiqiu Lin; Weihua Yang; Hailiang Zhang; Jinlong Shu

Book ID: 108052640
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 382 KB
Volume: 24
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.02.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eulerian iterated line graphs and digrap

Eulerian iterated line graphs and digraphs

✍ Erich Prisner 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Characterizations of second iterated lin

Characterizations of second iterated line graphs

✍ Zhao Guangfu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB

Iterated line graphs are maximally order

Iterated line graphs are maximally ordered

✍ Martin Knor; L'udovít Niepel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract A graph __G__ is __k__‐ordered if for every ordered sequence of __k__ vertices, there is a cycle in __G__ that encounters the vertices of the sequence in the given order. We prove that if __G__ is a connected graph distinct from a path, then there is a number __t~G~__ such that for ever

Connected graphs switching equivalent to

Connected graphs switching equivalent to their iterated line graphs

✍ B. Devadas Acharya 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 660 KB

## Dedlcared m my father on his 64th birthday of In this paper, the problem of determining graphs which are switching cqulvaknt to at least their iterated lme graphs is considered, and such connected graphs are characterized.

Convergent sequences of iterated H-line

Convergent sequences of iterated H-line graphs

✍ Gary Chartrand; Heather Gavlas; Michelle Schultz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 629 KB

For a connected graph H of order at least 3, the H-line graph HL(G) of a graph G is defined as that graph whose vertices are the edges of G and where two vertices of HL(G) are adjacent if and only if the corresponding edges of G are adjacent and belong to a common copy of H. For k >~ 2, the kth ite

Spanners of underlying graphs of iterate

Spanners of underlying graphs of iterated line digraphs

✍ Rabah Harbane; Carles Padró 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 770 KB

Given a simple undirected graph G, a spanning subgraph S is a t-spanner of G if every pair of vertices that are adjacent in G are at distance at most I in S. The factor t is called the dilution of the spanner. If S has the smallest possible number of edges among all t-spanners of G, then S is a mini