2017/12/09 by Chidambaram Annamalai · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Bipartite graph #Blossom algorithm #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Generalization #Graph #Hypergraph #Limits and Structures in Graph Theory #Line graph #Matching (statistics) #Mathematics #Pathwidth #Strong perfect graph theorem
paper · doi:10.1007/s00493-017-3567-2
crossref issued 2017/12/09 · crossref published 2017/12/09 · crossref published-online 2017/12/09 · openalex publication_date 2017/12/09 · crossref created 2017/12/09 · crossref published-print 2018/12/01 · crossref deposited 2022/08/10 · openalex created_date 2025/10/10 · crossref indexed 2026/02/01 · openalex updated_date 2026/07/29