2006/10/07 by Sang-il Oum, Sang‐il Oum, Paul Seymour · 33 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Function (biology) #Integer (computer science) #Interconnection Networks and Systems #Mathematical analysis #Mathematics #Matroid #Polynomial #Time complexity
paper · doi:10.1016/j.jctb.2006.06.006
published in Journal of Combinatorial Theory, Series B 97(3), 385-393 (Elsevier BV)
openalex publication_date 2006/10/07 · crossref created 2006/10/07 · crossref issued 2007/05/01 · crossref published 2007/05/01 · crossref published-print 2007/05/01 · crossref deposited 2019/01/12 · openalex created_date 2025/10/10 · crossref indexed 2026/07/19 · openalex updated_date 2026/07/23