A.M.H. Gerards
- Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
2002/03/01 by James F. Geelen, A.M.H. Gerards, Geoff Whittle · 65 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Class (philosophy) #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graphic matroid #Interconnection Networks and Systems #Mathematical analysis #Mathematics #Matroid #Tree (set theory)
- On the excluded minors for the matroids of branch-width k
2003/02/04 by Jim Geelen, J.F. Geelen, A.M.H. Gerards +4 · 29 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Class (philosophy) #Combinatorics #Computer science #Graph Labeling and Dimension Problems #Mathematics #Matroid #graph theory and CDMA systems
- The Excluded Minors for GF(4)-Representable Matroids
2000/07/01 by Jim Geelen, J.F. Geelen, A.M.H. Gerards +2 · 46 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Coding theory and cryptography #Combinatorics #Computer science #Finite field #GF(2) #Mathematics #Matroid #graph theory and CDMA systems
- A short proof of Tutte's characterization of totally unimodular matrices
1989/03/01 by A.M.H. Gerards · 27 citations
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Characterization (materials science) #Combinatorics #Discrete mathematics #Mathematics #Matroid #Unimodular matrix #graph theory and CDMA systems