Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs

DOI10.1137/110837188zbMath1268.05093arXiv1710.07206OpenAlexW2095266486MaRDI QIDQ5300495

Xiaoyan Zhang, Zan-Bo Zhang, Xuelian Wen

Publication date: 27 June 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.07206

zbMATH Keywords

degree sumOre-type conditiondirected Hamilton cyclematching alternating Hamilton cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (9)

Disjoint Cycles in a Digraph with Partial Degree ⋮ Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs ⋮ Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments ⋮ Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ On degree sum conditions for directed path-factors with a specified number of paths

This page was built for publication: Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs