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

On line graphs of linear 3-uniform hypergraphs

โœ Scribed by Metelsky, Yury; Tyshkevich, Regina

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
154 KB
Volume
25
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.

๐Ÿ“œ SIMILAR VOLUMES

On the linear arboricity of planar graph
On the linear arboricity of planar graphs
โœ Wu, Jian-Liang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB ๐Ÿ‘ 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree โˆ†. The conjecture has been proved to be true for graphs having โˆ† =

On the second largest eigenvalue of line
On the second largest eigenvalue of line graphs
โœ Petrovi?, Miroslav; Mileki?, Bojana ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 169 KB ๐Ÿ‘ 1 views

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.

On convex embeddings of planar 3-connect
On convex embeddings of planar 3-connected graphs
โœ Kelmans, Alexander ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB ๐Ÿ‘ 2 views

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in thi