A rooted graph with no two vertex-disjoint S-cycles always has an S-cycle hitting set of size at most four, and three do not suffice.
Adrian Bondy, and Bruce A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Graphs without two vertex-disjoint $S$-cycles
A rooted graph with no two vertex-disjoint S-cycles always has an S-cycle hitting set of size at most four, and three do not suffice.