𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Every 4-Connected Line Graph of a Planar Graph is Hamiltonian

✍ Scribed by Hong-Jian Lai

Publisher
Springer Japan
Year
1994
Tongue
English
Weight
217 KB
Volume
10
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Every connected graph is a query graph
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

Every connected, locally connected nontr
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
✍ David J. Oberly; Slobodan K. SimiΔ‡; David P. Sumner πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

## Abstract A graph is locally connected if every neighborthood induces a connected subgraph. We show here that every connected, locally connected graph on __p__ β‰₯ 3 vertices and having no induced __K__~1,3~ is Hamiltonian. Several sufficient conditions for a line graph to be Hamiltonian are obtain

Every 3-connected claw-free Z8-free grap
Every 3-connected claw-free Z8-free graph is Hamiltonian
✍ Hong-Jian Lai; Liming Xiong; Huiya Yan; Jin Yan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 2 views

## Abstract In this article, we first show that every 3‐edge‐connected graph with circumference at most 8 is supereulerian, which is then applied to show that a 3‐connected claw‐free graph without __Z__~8~ as an induced subgraph is Hamiltonian, where __Z__~8~ denotes the graph derived from identify