On 2-factors containing 1-factors in bipartite graphs

DOI10.1016/S0012-365X(99)90061-4zbMath0927.05065OpenAlexW4210481633MaRDI QIDQ1292826

Michael S. Jacobson, Guantao Chen, Ronald J. Gould

Publication date: 5 December 1999

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90061-4

zbMATH Keywords

degreebipartite graphsperfect matchinghamiltonian cycle\(2\)-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

Disjoint Cycles in a Digraph with Partial Degree, A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph, On degree sum conditions for directed path-factors with a specified number of paths, On 2-factors with prescribed properties in a bipartite graph, Proof of a conjecture on cycles in a bipartite graph, On 2-factors with cycles containing specified edges in a bipartite graph, A look at cycles containing specified elements of a graph

Cites Work

• Unnamed Item
• Proof of a conjecture of Haeggkvist on cycles and independent edges
• Cycles in 2-factors of balanced bipartite graphs
• On Hamiltonian bipartite graphs
• Cycles containing matchings and pairwise compatible euler tours
• Degree conditions for 2-factors
• Some Theorems on Abstract Graphs