2‐factors with prescribed and proscribed edges
Robert E. L. Aldred, Derek Holton, J. Sheehan · Journal of Graph Theory · 2005
Abstract Let G be a finite k‐edge‐connected simple graph. We consider when a set of independent edges can be extended to a 2‐factor such that this 2‐factor avoids a fixed set of independent edges. A complete characterization is provided in those cases, where this is feasible. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 48–58, 2005