AbstractKreweras' conjecture [G. Kreweras, Matchings and Hamiltonian cycles on hypercubes, Bull. Inst. Combin. Appl. 16 (1996) 87–91] asserts that any perfect matching of the hypercube Qd, d⩾2, can be extended to a Hamilton cycle. We prove this conjecture
In this paper we consider the existence of Hamilton cycles and perfect matchings in a random graph m...
It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is ...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
AbstractKreweras' conjecture [G. Kreweras, Matchings and Hamiltonian cycles on hypercubes, Bull. Ins...
Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extend...
AbstractRecently, Fink [J. Fink, Perfect matchings extend to Hamilton cycles in hypercubes, J. Combi...
AbstractKreweras’ conjecture [G. Kreweras, Matchings and hamiltonian cycles on hypercubes, Bull. Ins...
Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 exte...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
The first part of this thesis concerns perfect matchings and their generalisations. We determine the...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
AbstractWe establish a new lower bound on the l-wise collective minimum degree which guarantees the ...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
One of the basic streams of modern statistical physics is an effort to understand the frustration an...
In this paper we consider the existence of Hamilton cycles and perfect matchings in a random graph m...
It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is ...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
AbstractKreweras' conjecture [G. Kreweras, Matchings and Hamiltonian cycles on hypercubes, Bull. Ins...
Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extend...
AbstractRecently, Fink [J. Fink, Perfect matchings extend to Hamilton cycles in hypercubes, J. Combi...
AbstractKreweras’ conjecture [G. Kreweras, Matchings and hamiltonian cycles on hypercubes, Bull. Ins...
Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 exte...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
The first part of this thesis concerns perfect matchings and their generalisations. We determine the...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
AbstractWe establish a new lower bound on the l-wise collective minimum degree which guarantees the ...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
One of the basic streams of modern statistical physics is an effort to understand the frustration an...
In this paper we consider the existence of Hamilton cycles and perfect matchings in a random graph m...
It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is ...
AbstractWe give sufficient Ore-type conditions for a balanced bipartite graph to contain every match...
DOI
Add to ORKG