On 2-factors with a bounded number of odd components

DOI10.1016/J.DISC.2014.01.005MaRDI QIDQ2439124zbMATH OpenOpenAlexWikidataFDO

Authors Jennifer Diemunsch, Michael Ferrara, Samantha Graffeo, Tim R. Morris

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

zbMATH Keywords

2-factorclaw-freeclosuredisjoint 1-factors

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• 2-factors with bounded number of components in claw-free graphs
• On components of 2-factors in claw-free graphs
• Closure operation for even factors on claw-free graphs
• Closure concept for 2-factors in claw-free graphs
• 2-factors in claw-free graphs

Cites work

• A pair of forbidden subgraphs and 2-factors
• Advances on the Hamiltonian problem -- a survey
• Closure, 2-factors, and cycle coverings in claw-free graphs
• Double covers of cubic graphs with oddness 4
• Factorizations of regular graphs
• Factorizations of regular graphs of high degree
• Factors and factorizations of graphs. Proof techniques in factor theory
• Five cycle double covers of some cubic graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Forbidden subgraphs that imply 2-factors
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 3728302 (Why is no real title available?)
• On a closure concept in claw-free graphs
• On cycle-double covers of graphs of small oddness
• On disjoint matchings in cubic graphs
• On edge-disjoint pairs of matchings
• On the number of components in 2-factors of claw-free graphs
• On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
• On the perfect matchings of near regular graphs
• Polyhedral decompositions of cubic graphs
• Regular factors in K_1,3‐free graphs
• Regular factors in K_1,n free graphs
• The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity
• The NP-Completeness of Edge-Coloring
• Updating the hamiltonian problem—A survey

Cited in

(4)

• Some existence theorems on all fractional (g,f)-factors with prescribed properties
• Odd 2-factored snarks
• p+2 WITH FEW AND BOUNDED PRIME FACTORS
• Odd solutions of \sigma(n)-2n=2 have at least six distinct prime factors

This page was built for publication: On 2-factors with a bounded number of odd components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439124)