On Enomoto's problems in a bipartite graph
From MaRDI portal
Publication:1044262
DOI10.1007/s11425-009-0012-zzbMath1229.05188MaRDI QIDQ1044262
Publication date: 11 December 2009
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-009-0012-z
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
The confirmation of a conjecture on disjoint cycles in a graph, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Large vertex-disjoint cycles in a bipartite graph
- On the maximum number of independent cycles in a bipartite graph
- On 2-factors with prescribed properties in a bipartite graph
- On 2-factors of a bipartite graph
- Proof of a conjecture on cycles in a bipartite graph
- On the maximal number of independent circuits in a graph
- Disjoint triangles and quadrilaterals in a graph
- Graph partition problems into cycles and paths