Vertex-disjoint cycles containing specified vertices in a bipartite graph

DOI10.1007/s00373-016-1689-8zbMath1351.05186OpenAlexW2314139685MaRDI QIDQ343781

Shaohua Zhang, Jin Yan, Su-yun Jiang

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1689-8

zbMATH Keywords

bipartite graphpathvertex-disjoint cyclesquadrilateral

Mathematics Subject Classification ID

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

Related Items (1)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

Cites Work

• Proof of the Erdős-Faudree conjecture on quadrilaterals
• On circuits in graphs
• Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
• On 2-factors with cycles containing specified edges in a bipartite graph
• On 2-factors with cycles containing specified vertices in a bipartite graph
• On the maximum number of independent cycles in a bipartite graph
• Cycles in 2-factors of balanced bipartite graphs
• Vertex-disjoint cycles containing specified edges
• On 2-factors with prescribed properties in a bipartite graph
• Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
• Proof of a conjecture on cycles in a bipartite graph
• On the maximal number of independent circuits in a graph
• Disjoint triangles and quadrilaterals in a graph

This page was built for publication: Vertex-disjoint cycles containing specified vertices in a bipartite graph