Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph

DOI10.1016/j.disc.2004.02.019zbMath1053.05075OpenAlexW2031552896MaRDI QIDQ1887633

Philip Sinclair

Publication date: 22 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

1-factorsRemovable even circuits

Mathematics Subject Classification ID

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

Cites Work

• On removable even circuits in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph