Partial degrees on matchings for cycles in bipartite graphs

DOI10.1016/J.DISC.2024.114142zbMATH Open1543.05152MaRDI QIDQ6570058FDOQ6570058

Authors: Hong Wang 

Publication date: 10 July 2024

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

Recommendations

• Disjoint cycles covering matchings in graphs with partial degrees
• Proof of a conjecture on cycles in a bipartite graph
• scientific article; zbMATH DE number 1334624
• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
• Partial degree conditions and cycle coverings in bipartite graphs

zbMATH Keywords

coveringsmatchingsdisjoint cycles

Mathematics Subject Classification ID

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

Cites Work

• On the maximal number of independent circuits in a graph
• Title not available (Why is that?)
• 2‐neighborhoods and hamiltonian conditions
• Edge disjoint placement of graphs
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Embedding Arbitrary Graphs of Maximum Degree Two
• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
• On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
• Partial Degree Conditions and Cycle Coverings
• Disjoint Cycles in a Digraph with Partial Degree
• Disjoint cycles covering matchings in graphs with partial degrees
• A degree condition for cycles passing through specified vertices and edges

Cited In (3)

• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
• A Hall-type condition for path covers in bipartite graphs
• The double Hall property and cycle covers in bipartite graphs

This page was built for publication: Partial degrees on matchings for cycles in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570058)