Extensions to 2-factors in bipartite graphs
From MaRDI portal
Publication:396808
zbMath1295.05188MaRDI QIDQ396808
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
Related Items
Perfect matchings extend to two or more Hamiltonian cycles in hypercubes ⋮ Minimal graphs for 2-factor extension ⋮ Proper orientations and proper chromatic number ⋮ Towards a problem of Ruskey and Savage on matching extendability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factors and factorizations of graphs. Proof techniques in factor theory
- Minimum degree of bipartite graphs and the existence of k-factors
- Matching graphs of hypercubes and complete bipartite graphs
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Circuits through specified edges
- Graph factors
- Long cycles through a linear forest
- Perfect matchings extend to Hamilton cycles in hypercubes
- Graphs and Subgraphs
- HAMILTONIAN CYCLES THROUGH MATCHINGS
- Matching Extendability in Hypercubes
- On diagnosability of large fault sets in regular topology-based computer systems
- Linear forests and ordered cycles
- Matching, Euler tours and the Chinese postman
- Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n $
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Flows in infinite graphs
