AbstractRecently, Fink [J. Fink, Perfect matchings extend to Hamilton cycles in hypercubes, J. Combin. Theory Ser. B 97 (2007) 1074–1076] affirmatively answered Kreweras’ conjecture asserting that every perfect matching of the hypercube extends to a Hamiltonian cycle. We strengthen this result in the following way. Given a partition of the hypercube into subcubes of nonzero dimensions, we show for every perfect matching of the hypercube that it extends on these subcubes to a Hamiltonian cycle if and only if it interconnects them
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
Abstract — A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any ...
In this paper, we discuss many properties of graphs of Matching Composition Net-works (MCN) [16]. A ...
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...
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...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
We establish a new lower bound on the l-wise collective minimum degree which guarantees the existenc...
AbstractWe establish a new lower bound on the l-wise collective minimum degree which guarantees the ...
AbstractA perfect matching or a 1-factor of a graph G is a spanning subgraph that is regular of degr...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
One of the basic streams of modern statistical physics is an effort to understand the frustration an...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
Abstract — A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any ...
In this paper, we discuss many properties of graphs of Matching Composition Net-works (MCN) [16]. A ...
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...
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...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
We establish a new lower bound on the l-wise collective minimum degree which guarantees the existenc...
AbstractWe establish a new lower bound on the l-wise collective minimum degree which guarantees the ...
AbstractA perfect matching or a 1-factor of a graph G is a spanning subgraph that is regular of degr...
This thesis contains problems in finding spanning subgraphs in graphs, such as, perfect matchings, t...
One of the basic streams of modern statistical physics is an effort to understand the frustration an...
[[abstract]]A bipartite graph is bipancyclic if it contains a cycle of every even length from 4 to j...
Abstract — A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any ...
In this paper, we discuss many properties of graphs of Matching Composition Net-works (MCN) [16]. A ...