Extensions to 2-factors in bipartite graphs
From MaRDI portal
Publication:396808
zbMATH Open1295.05188MaRDI QIDQ396808FDOQ396808
Jennifer Vandenbussche, Douglas B. West
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p11
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- Title not available (Why is that?)
- Matching, Euler tours and the Chinese postman
- On diagnosability of large fault sets in regular topology-based computer systems
- Factors and factorizations of graphs. Proof techniques in factor theory
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Graph factors
- Perfect matchings extend to Hamilton cycles in hypercubes
- Matching graphs of hypercubes and complete bipartite graphs
- Matching Extendability in Hypercubes
- Title not available (Why is that?)
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Circuits through specified edges
- Long cycles through a linear forest
- Graphs and Subgraphs
- HAMILTONIAN CYCLES THROUGH MATCHINGS
- Title not available (Why is that?)
- Linear forests and ordered cycles
- Title not available (Why is that?)
- Flows in infinite graphs
- Minimum degree of bipartite graphs and the existence of k-factors
Cited In (5)
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)