𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every 3-connected essentially 10-connected line graph is Hamilton-connected

✍ Scribed by Hao Li; Weihua Yang


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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Every 3-connected, locally connected, cl
✍ Asratian, A. S. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 639 KB

A graph G is locally connected if the subgraph induced by the neighbourhood of each vertex is connected. We prove that a locally connected graph G of orderp 2 4, containing no induced subgraph isomorphic to K1,31 is Hamilton-connected if and only if G is 3connected.

Every connected, locally connected graph
✍ Ladislav NebeskΓ½ πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract In this Note it is proved that every connected, locally connected graph is upper embeddable. Moreover, a lower bound for the maximum genus of the square of a connected graph is given.

Every connected graph is a query graph
✍ Peter M. Winkler πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

Let Vbe a set of bit strings of length k, i.e., V C {0, l}'. The query graph Q ( V ) is defined as follows: the vertices of Q(V) are the elements of V, and {O,V} is an edge of Q ( V ) if and only if no other W E Vagrees with U in all the positions in which V does. If Vrepresents the set of keys for

Hamiltonicity of 3-connected line graphs
✍ Weihua Yang; Liming Xiong; Hongjian Lai; Xiaofeng Guo πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 199 KB