Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3722690 (Why is no real title available?)
- scientific article; zbMATH DE number 888853 (Why is no real title available?)
- scientific article; zbMATH DE number 2199618 (Why is no real title available?)
- Circuits through specified edges
- Factors and factorizations of graphs. Proof techniques in factor theory
- Flows in infinite graphs
- Graph factors
- Graphs and Subgraphs
- HAMILTONIAN CYCLES THROUGH MATCHINGS
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Linear forests and ordered cycles
- Long cycles through a linear forest
- Matching Extendability in Hypercubes
- Matching graphs of hypercubes and complete bipartite graphs
- Matching, Euler tours and the Chinese postman
- Minimum degree of bipartite graphs and the existence of k-factors
- On diagnosability of large fault sets in regular topology-based computer systems
- Perfect matchings extend to Hamilton cycles in hypercubes
- Proof of a conjecture of Haeggkvist on cycles and independent edges
Cited in
(8)- Two sufficient conditions for a 2-factor in a bipartite graph
- Matchings in hypercubes extend to long cycles
- Proper orientations and proper chromatic number
- Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
- Minimal graphs for 2-factor extension
- Matchings in hypercubes extend to long cycles
- Towards a problem of Ruskey and Savage on matching extendability
- On Tuza's conjecture in dense graphs
This page was built for publication: Extensions to 2-factors in bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396808)
