Article citationsMore>>
Karp, R.M. (1972) Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. and Bohlinger, J.D., Eds., Complexity of Computer Computations, Springer, 85-103.
https://doi.org/10.1007/978-1-4684-2001-2_9
has been cited by the following article:
-
TITLE:
Forbidden Subgraphs for the Existence of an Even Factor with Exactly Two Components in 2-Edge-Connected Graphs
AUTHORS:
Dan Zhou, Shengmei Lv
KEYWORDS:
Even Factor, Odd Branch-Bond, Forbidden Pair, Edge-Branch
JOURNAL NAME:
Applied Mathematics,
Vol.17 No.1,
January
26,
2026
ABSTRACT: In this paper, we mainly consider characterize all the pairs
{
R,S }
of 2-edge-connected graphs
G
such that every
{
R,S }
-free graph
G
has an even factor with exactly two components if and only if
δ(
G
)≥2
and every odd branch-bond of
G
has an edge branch.