Premium
2‐factors with prescribed and proscribed edges
Author(s) -
Aldred R. E. L.,
Holton D. A.,
Sheehan J.
Publication year - 2005
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20065
Subject(s) - mathematics , combinatorics , graph , enhanced data rates for gsm evolution , simple (philosophy) , set (abstract data type) , characterization (materials science) , discrete mathematics , graph theory , simple graph , computer science , artificial intelligence , philosophy , epistemology , programming language , materials science , nanotechnology
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