On 2-factors with a bounded number of odd components
From MaRDI portal
Publication:2439124
DOI10.1016/j.disc.2014.01.005zbMath1283.05146OpenAlexW2109396373WikidataQ114190737 ScholiaQ114190737MaRDI QIDQ2439124
Timothy Morris, Jennifer Diemunsch, Samantha Graffeo, Michael Ferrara
Publication date: 7 March 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.01.005
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Factors and factorizations of graphs. Proof techniques in factor theory
- On the perfect matchings of near regular graphs
- Factorizations of regular graphs
- On disjoint matchings in cubic graphs
- On edge-disjoint pairs of matchings
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- On a closure concept in claw-free graphs
- Advances on the Hamiltonian problem -- a survey
- Double covers of cubic graphs with oddness 4
- Five cycle double covers of some cubic graphs
- On the number of components in 2-factors of claw-free graphs
- Forbidden subgraphs that imply 2-factors
- A Pair of Forbidden Subgraphs and 2-Factors
- The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
- Hamiltonian results inK1,3-free graphs
- Factorizations of regular graphs of high degree
- The NP-Completeness of Edge-Coloring
- Updating the hamiltonian problem—A survey
- Regular factors in K1,3‐free graphs
- Regular factors in K1,n free graphs
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Polyhedral decompositions of cubic graphs
- On cycle-double covers of graphs of small oddness
This page was built for publication: On 2-factors with a bounded number of odd components
