The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper the following theorem is proved: Let be a connected graph of order and let be a matching in . Then there exists a hamiltonian cycle of such that .
In this paper the following results are proved: 1. Let be a path with vertices, where and . Let be a matching in . Then is hamiltonian-connected. 2. Let be a connected graph of order , and let be a matching in . Then is hamiltonian-connected.
Download Results (CSV)