Partial degrees on matchings for cycles in bipartite graphs
From MaRDI portal
Publication:6570058
DOI10.1016/J.DISC.2024.114142zbMATH Open1543.05152MaRDI QIDQ6570058
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Edge disjoint placement of graphs
- 2‐neighborhoods and hamiltonian conditions
- Embedding Arbitrary Graphs of Maximum Degree Two
- On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
- Partial Degree Conditions and Cycle Coverings
- Disjoint cycles covering matchings in graphs with partial degrees
- On the maximal number of independent circuits in a graph
- Disjoint Cycles in a Digraph with Partial Degree
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- A degree condition for cycles passing through specified vertices and edges
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)
