Non-zero disjoint cycles in highly connected group labeled graphs
References (11)
- M. Chudnovsky, J. Geelen, B. Gerards, L. Goddyn, M. Lohman and P. Seymour, Packing non-zero A-paths in group labeled...
- et al.
On the maximal number of disjoint circuits of a graph
Publ. Math. Debrecen
(1962) - K. Kawarabayashi, The Erdős-Pósa property for totally odd Kk-subdivisions in highly connected graphs,...
- K. Kawarabayashi and A. Nakamoto, The Erdős-Pósa property for vertex- and edge-disjoint odd cycles on an orientable...
- K. Kawarabayashi and B. Reed, Highly parity linked graphs,...
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2005 Elsevier B.V. All rights reserved.