On 2-factors with cycles containing specified vertices in a bipartite graph

DOI10.1007/S12190-008-0202-9zbMath1229.05166OpenAlexW2021598581MaRDI QIDQ1034963

Jin Yan, Guo Jun Li, Yun Shu Gao

Publication date: 9 November 2009

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0202-9

zbMATH Keywords

bipartite graph2-factorquadrilateralvertex-disjoint

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Unnamed Item
• A method in graph theory
• On the bipartite case of El-Zahár's conjecture
• \(H\)-factors in dense graphs
• On 2-factors with prescribed properties in a bipartite graph
• Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
• On 2-factors of a bipartite graph
• Degree conditions for 2-factors
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: On 2-factors with cycles containing specified vertices in a bipartite graph