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

On the hardness of recognizing triangular line graphs

โœ Scribed by Pranav Anand; Henry Escuadro; Ralucca Gera; Stephen G. Hartke; Derrick Stolee

Book ID
113567535
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
399 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Convergence of sequences of iterated tri
Convergence of sequences of iterated triangular line graphs
โœ David Dorrough ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 333 KB

The triangular line graph T(G) of a graph G is the graph with vertex set E(G), with two distinct vertices e and f of T(G) adjacent if and only if the edges e and f belong to a common copy ofK 3 in G. For n/> 1, the nth iterated triangular line graph T"(G) of a graph G is defined as T(T n-I(G)), wher

On the complexity of recognizing tough g
On the complexity of recognizing tough graphs
โœ Douglas Bauer; Aurora Morgana; Edward Schmeichel ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 252 KB
3-Connected line graphs of triangular gr
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
โœ H. J. Broersma; H. J. Veldman ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB ๐Ÿ‘ 1 views

A graph is k-triangular if each edge is in at least k triangles. Triangular is a synonym for l-triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3-connected. Furthermore, the line graph of a k-triangular graph is k-harniltonian