On 2-factors containing 1-factors in bipartite graphs
From MaRDI portal
Publication:1292826
DOI10.1016/S0012-365X(99)90061-4zbMATH Open0927.05065OpenAlexW4210481633MaRDI QIDQ1292826FDOQ1292826
Authors: Guantao Chen, Michael Jacobson, Ronald Gould 
Publication date: 5 December 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90061-4
Recommendations
- scientific article; zbMATH DE number 2147779
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- On 2-factors with cycles containing specified vertices in a bipartite graph
- On 2-factors of a bipartite graph
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Some Theorems on Abstract Graphs
- On Hamiltonian bipartite graphs
- Cycles containing matchings and pairwise compatible euler tours
- Cycles in 2-factors of balanced bipartite graphs
- Degree conditions for 2-factors
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Title not available (Why is that?)
Cited In (14)
- Extensions to 2-factors in bipartite graphs
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- On 2-factors with prescribed properties in a bipartite graph
- On degree sum conditions for directed path-factors with a specified number of paths
- Title not available (Why is that?)
- Proof of a conjecture on cycles in a bipartite graph
- A look at cycles containing specified elements of a graph
- Bipartite multigraphs with 1‐factors containing specified edges
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Disjoint Cycles in a Digraph with Partial Degree
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
- On 2-factors with cycles containing specified edges in a bipartite graph
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- Two sufficient conditions for a 2-factor in a bipartite graph
This page was built for publication: On 2-factors containing 1-factors in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292826)
