Seymour Decomposition
Seymour Decomposition is a structural decomposition theorem in matroid theory that characterizes regular matroids as those that can be constructed from graphic matroids, cographic matroids, and a specific 10-element matroid via certain composition operations.
17
Publications
674
Citations
30
Authors
16
Institutions
Publications per year
2017–2026
1
Parents
17
Finding Branch-Decompositions and Rank-Decompositions
Petr Hliněný, Sang‐il Oum · SIAM Journal on Computing · 2008 · 136 citations
Mason W. Tyler, Eland House, Charles Seymour · The Mississippi Valley Historical Review · 1921 · 48 citations
Humanities, History, Peace Studies +11
1–5 of 17
30
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 30
16
Rutgers, The State University of New Jersey
New Brunswick, United States
2 h-index
3 publications
342 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
31 citations

Victoria University of Wellington
Wellington, New Zealand
2 h-index
2 publications
34 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
2 publications
20 citations

Worcester Polytechnic Institute
Worcester, United States
1 h-index
1 publications
158 citations
West Virginia University
Morgantown, United States
1 h-index
1 publications
18 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
26 citations
Queen's University
Kingston, Canada
1 h-index
1 publications
60 citations
1–8 of 16
2 publications · 20 citations
2
h-index
2 publications · 26 citations
2
h-index
1 publications · 24 citations
1
h-index
1 publications · 26 citations
1
h-index
1 publications · 48 citations
1
h-index
1–5