Non-separating 2-factors of an even-regular graph

DOI10.1016/J.DISC.2007.10.021MaRDI QIDQ998434zbMATH OpenOpenAlexFDO

Authors Yusuke Higuchi, Yuji Nomura

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.10.021

zbMATH Keywords

2-factoreven-regular graphnon-separating

Mathematics Subject Classification ID

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

Recommendations

• Regular factors in regular graphs
• Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph
• 2-factors of regular graphs: an updated survey
• Regular factors in 2-connected \(K_{1,n}\)-free graphs
• Vertex-deleted subgraphs and regular factors from regular graph

Cites work

• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Hamilton cycles in regular 2-connected graphs
• Some Theorems on Abstract Graphs
• Spectral structure of the Laplacian on a covering graph

Cited in

(1)

• 2-factors of regular graphs: an updated survey

This page was built for publication: Non-separating 2-factors of an even-regular graph

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