2‐factors with prescribed and proscribed edges

DOI10.1002/JGT.20065zbMATH Open1062.05117OpenAlexW4244898787MaRDI QIDQ4680404FDOQ4680404

Authors: R. E. L. Aldred, Derek Holton, J. Sheehan 

Publication date: 1 June 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20065

Recommendations

• Extending matchings to 2-factors
• \(k\)-factors containing and avoiding specified sets of edges
• Two-edge-connected \([2,k]\)-factors in graphs
• scientific article; zbMATH DE number 1743771
• Forbidden pairs of disconnected graphs for 2‐factor of connected graphs

Mathematics Subject Classification ID

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

Cited In (4)

• Repeated edges in 2-factorizations
• Extending matchings to 2-factors
• Perfect matchings in highly cyclically connected regular graphs
• Odd 2-factored snarks

This page was built for publication: 2‐factors with prescribed and proscribed edges

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