EuDML | Browse

Page 1

Displaying 1 – 5 of 5

Hamilton decompositions and $(n / 2)$ -factorizations of hypercubes.

Bass, Douglas W., Sudborough, I.Hal (2003)

Journal of Graph Algorithms and Applications

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 \geq 5$ and $n \neq 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 \geq 5$ , and let $M$ be a matching in $G$ . Then $G^{5} - M$ is hamiltonian-connected.

Homomorphisms of infinite bipartite graphs onto complete bipartite graphs

Bohdan Zelinka (1983)

Czechoslovak Mathematical Journal

Hyperbolic and Parabolic Packings.

Zheng-Xu He, O. Schramm (1995)

Discrete & computational geometry