On 2-factors with cycles containing specified edges in a bipartite graph
From MaRDI portal
Publication:1011783
DOI10.1016/j.disc.2007.11.072zbMath1179.05091OpenAlexW2098661257MaRDI QIDQ1011783
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.072
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (2)
Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Cites Work
- Unnamed Item
- On circuits in graphs
- On 2-factors containing 1-factors in bipartite graphs
- Vertex-disjoint cycles containing specified edges
- On 2-factors with prescribed properties in a bipartite graph
- Vertex-disjoint quadrilaterals in bipartite graphs
- On 2-factors of a bipartite graph
- Proof of a conjecture on cycles in a bipartite graph
- Degree conditions for 2-factors
- On the maximal number of independent circuits in a graph
- Disjoint triangles and quadrilaterals in a graph
- Graph partition problems into cycles and paths
This page was built for publication: On 2-factors with cycles containing specified edges in a bipartite graph