Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
From MaRDI portal
Publication:5300495
DOI10.1137/110837188zbMath1268.05093arXiv1710.07206MaRDI 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
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
05C07: Vertex degrees
Related Items
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs, Disjoint Cycles in a Digraph with Partial Degree, Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced 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, Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
