Matchings Extend to Hamiltonian Cycles in 5-Cube

Fan Wang; Weisheng Zhao

The search session has expired. Please query the service again.

Displaying similar documents to “Matchings Extend to Hamiltonian Cycles in 5-Cube”

Directed and antidirected Hamiltonian cycles and paths in bipartite graphs

N. Chakroun, M. Manoussakis, Y. Manoussakis (1989)

Banach Center Publications

Similarity:

Knotted Hamiltonian cycles in spatial embeddings of complete graphs.

Blain, Paul, Bowlin, Garry, Foisy, Joel, Hendricks, Jacob, LaCombe, Jason (2007)

The New York Journal of Mathematics [electronic only]

Similarity:

Pancyclism and small cycles in graphs

Ralph Faudree, Odile Favaron, Evelyne Flandrin, Hao Li (1996)

Discussiones Mathematicae Graph Theory

Similarity:

We first show that if a graph G of order n contains a hamiltonian path connecting two nonadjacent vertices u and v such that d(u)+d(v) ≥ n, then G is pancyclic. By using this result, we prove that if G is hamiltonian with order n ≥ 20 and if G has two nonadjacent vertices u and v such that d(u)+d(v) ≥ n+z, where z = 0 when n is odd and z = 1 otherwise, then G contains a cycle of length m for each 3 ≤ m ≤ max (dC(u,v)+1, [(n+19)/13]), $d_{C} (u, v)$ being the distance of u and v on a hamiltonian cycle...

On theH-Force Number of Hamiltonian Graphs and Cycle Extendability

Erhard Hexel (2017)

Discussiones Mathematicae Graph Theory

Similarity:

The H-force number h(G) of a hamiltonian graph G is the smallest cardinality of a set A ⊆ V (G) such that each cycle containing all vertices of A is hamiltonian. In this paper a lower and an upper bound of h(G) is given. Such graphs, for which h(G) assumes the lower bound are characterized by a cycle extendability property. The H-force number of hamiltonian graphs which are exactly 2-connected can be calculated by a decomposition formula.

Sharp sufficient conditions for Hamiltonian cycles in tough graphs

Z. Skupień (1989)

Banach Center Publications

Similarity:

The Chvátal-Erdős condition and 2-factors with a specified number of components

Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer (2007)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a 2-connected graph of order n satisfying α(G) = a ≤ κ(G), where α(G) and κ(G) are the independence number and the connectivity of G, respectively, and let r(m,n) denote the Ramsey number. The well-known Chvátal-Erdös Theorem states that G has a hamiltonian cycle. In this paper, we extend this theorem, and prove that G has a 2-factor with a specified number of components if n is sufficiently large. More precisely, we prove that (1) if n ≥ k·r(a+4, a+1), then G has a 2-factor...

A note on the Hamiltonian genus of a complete bipartite graph.

Demovič, A. (1995)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Generating hamiltionian cycles in complete graphs.

Fleischner, H., Horák, P., Širáň, J. (1993)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

A note on Hamiltonian cycles in generalized Halin graphs

Magdalena Bojarska (2010)

Discussiones Mathematicae Graph Theory

Similarity:

We show that every 2-connected (2)-Halin graph is Hamiltonian.

A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.

R.B. Hayward (1987)

Discrete & computational geometry

Similarity:

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao, Minyong Shi, Lihua Feng (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn...

Hamiltonian paths on Platonic graphs.

Hopkins, Brian (2004)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Improved Sufficient Conditions for Hamiltonian Properties

Jens-P. Bode, Anika Fricke, Arnfried Kemnitz (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity...

Hamiltonian Dynamics on Pseudodifferential Symbols

Boris Khesin (1993)

Recherche Coopérative sur Programme n°25

Similarity:

Hamiltonian Systems Close to Integrable Systems

E. Zenhder (1975)

Publications mathématiques et informatique de Rennes

Similarity:

Hamiltonian cycles in skirted trees

M. Skowrońska, M. M. Sysło (1987)

Applicationes Mathematicae

Similarity:

On Hamiltonian consecutive-d digraphs

D. Z. Du, D. F. Hsu (1989)

Banach Center Publications

Similarity:

On Vertices Enforcing a Hamiltonian Cycle

Igor Fabrici, Erhard Hexel, Stanislav Jendrol’ (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined.

Existence and distribution of limit cycles in a Hamiltonian system.

Tigan, Gheorghe (2006)

Applied Mathematics E-Notes [electronic only]

Similarity: