Disjoint cycles covering specified vertices in bipartite graphs with partial degrees

DOI10.1016/j.amc.2022.127626arXiv2011.10791OpenAlexW4307958662MaRDI QIDQ6041509

Jin Yan, Su-yun Jiang

Publication date: 31 May 2023

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

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

zbMATH Keywords

coveringbipartite graphsdisjoint cyclespartial degree

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Cycles through specified vertices
• A look at cycles containing specified elements of a graph
• A method in graph theory
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• On the maximum number of independent cycles in a bipartite graph
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• Partial degree conditions and cycle coverings in bipartite graphs
• On Hamiltonian bipartite graphs
• Graph Theory
• 2‐neighborhoods and hamiltonian conditions
• On 2-factors of a bipartite graph
• Partial Degree Conditions and Cycle Coverings
• 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees
• Some Theorems on Abstract Graphs
• A degree condition of 2-factors in bipartite graphs
• Cyclability and pancyclability in bipartite graphs

This page was built for publication: Disjoint cycles covering specified vertices in bipartite graphs with partial degrees