Document Type
Lecture
Publication Date
3-24-2004
Abstract
Given a connected multigraph G and three nonempty even-sized subsets A, B, C of V(G), when does G have two disjoint connected subgraphs G1 and G2 such that V(G1) ∪ V(G2) = V(G), and |V(G1) ∩ A|, |V(G1) ∩ B|, and |V(G1) ∩ C| are all odd? This problem was solved by Chakravarti and Robertson in 1979 for the special case where |A| = |B| = |C| = 2, which is a variation of a result on disjoint paths proved independently by Seymour, Shiloach, and Thomassen. In this talk, I will present a solution of this problem for cycles and for all 3-connected multigraphs. This is joint work with Xujin Chen and Wenan Zang of University of Hong Kong.
Relational Format
presentation
Recommended Citation
Yu, Xingxing, "Bonds in 3-connected Mulitgraphs" (2004). Combinatorics Seminar. 102.
https://egrove.olemiss.edu/math_combinatorics/102
