Can I read Linkability in Iterated Line Graphs on EtoBox?
Linkability in Iterated Line Graphs by Thomas Böhme; Martin Knor; L’udovít Niepel is a Computer Science article available to read on EtoBox.
What is Linkability in Iterated Line Graphs about?
We prove that for every graph H with the minimum degree 5, the third iterated line graph L 3 (H ) of H contains K √ -1 as a minor. Using this fact we prove that if G is a connected graph distinct from a path, then there is a number k G such that for every i k G the i-iterated line graph of G is 1 2 (L i (G))-linked. Since the degree of L i (G) is even, the result is best possible.
Who reads Linkability in Iterated Line Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Thomas Böhme; Martin Knor; L’udovít Niepel
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0012-365X)
- Published
- 2006
- Language
- EN
- Field
- Computer Science (Physical Sciences)