A Hall-type condition for path covers in bipartite graphs
From MaRDI portal
Publication:6614154
DOI10.37236/12462zbMATH Open1548.05274MaRDI QIDQ6614154
Mikhail Lavrov, Jennifer Vandenbussche
Publication date: 7 October 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Hypergraphs (05C65) Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Oriented hypergraphs, stability numbers and chromatic numbers
- Advances on the Hamiltonian problem -- a survey
- On vertex-disjoint paths in regular graphs
- On Hamiltonian Berge cycles in [3]-uniform hypergraphs
- Conditions for a bigraph to be super-cyclic
- Path partitions of almost regular graphs
- A Theorem in Finite Projective Geometry and Some Applications to Number Theory
- On the path partition number of 6‐regular graphs
- The double Hall property and cycle covers in bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A Hall-type condition for path covers in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614154)
