AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this paper, we prove that there exist a large set of Hamilton cycle decomposition of K2t,2t and a large set of Hamilton cycle decomposition of K2t+1,2t+1−I
AbstractWe prove a result on the length of a longest cycle in a graph on n vertices that contains a ...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractIn this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a ...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractThe authors discuss a hamilton surface of a graph, which is a two-dimensional analog of a ha...
AbstractWe establish the necessary and sufficient conditions for the existence of a cyclic Hamiltoni...
AbstractWe construct multigraphs of any large order with as few as only four 2-decompositions into H...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
AbstractA fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycl...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In...
Diamond open accessIn this paper, we provide necessary and sufficient conditions for the existence of ...
AbstractThe existence spectrums for large sets of Hamilton cycle decompositions and Hamilton path de...
AbstractWe prove a result on the length of a longest cycle in a graph on n vertices that contains a ...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
AbstractLet K2t+1,2t+1−I denote the complete bipartite graph K2t+1,2t+1 minus a 1-factor. In this pa...
AbstractIn this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a ...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractThe authors discuss a hamilton surface of a graph, which is a two-dimensional analog of a ha...
AbstractWe establish the necessary and sufficient conditions for the existence of a cyclic Hamiltoni...
AbstractWe construct multigraphs of any large order with as few as only four 2-decompositions into H...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
AbstractA fair hamilton decomposition of the complete multipartite graph G is a set of hamilton cycl...
In this paper we prove the following results (via a unified approach) for all sufficiently large n: ...
Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In...
Diamond open accessIn this paper, we provide necessary and sufficient conditions for the existence of ...
AbstractThe existence spectrums for large sets of Hamilton cycle decompositions and Hamilton path de...
AbstractWe prove a result on the length of a longest cycle in a graph on n vertices that contains a ...
The Hamilton–Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s ...
AbstractIt is shown that K2m∗, 2m ≥ 8, can be decomposed into Hamiltonian circuits. A direct constru...
DOI
Add to ORKG