Page 1

Displaying 1 – 5 of 5

Showing per page

Hamilton decompositions of line graphs of some bipartite graphs

David A. Pike (2005)

Discussiones Mathematicae Graph Theory

Some bipartite Hamilton decomposable graphs that are regular of degree δ ≡ 2 (mod 4) are shown to have Hamilton decomposable line graphs. One consequence is that every bipartite Hamilton decomposable graph G with connectivity κ(G) = 2 has a Hamilton decomposable line graph L(G).

Hamiltonian connectedness and a matching in powers of connected graphs

Elena Wisztová (1995)

Mathematica Bohemica

In this paper the following results are proved: 1. Let P n be a path with n vertices, where n 5 and n 7 , 8 . Let M be a matching in P n . Then ( P n ) 4 - M is hamiltonian-connected. 2. Let G be a connected graph of order p 5 , and let M be a matching in G . Then G 5 - M is hamiltonian-connected.

Currently displaying 1 – 5 of 5

Page 1