Graphic Matroids
A Graphic Matroid is a matroid defined on the edge set of an undirected graph, in which the independent sets are the edge sets of acyclic subgraphs, thereby generalizing the notion of linear independence to graph-theoretic structures.
46
Publications
2K
Citations
82
Authors
49
Institutions
Publications per year
2017–2026
5
Variants
Graphic Matroid
Parents
46
On the Sandpile Group of Dual Graphs
Robert Cori, Dominique Rossin · European Journal of Combinatorics · 2000 · 169 citations
1–5 of 46
82
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 82
49
Wright State University
Dayton, United States
4 h-index
5 publications
70 citations

Victoria University of Wellington
Wellington, New Zealand
4 h-index
4 publications
99 citations
University of California, Berkeley
Berkeley, United States
3 h-index
5 publications
465 citations
University of Colorado Boulder
Boulder, United States
3 h-index
4 publications
166 citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
69 citations

Cornell University
Ithaca, United States
2 h-index
2 publications
258 citations

United States Naval Academy
Annapolis, United States
2 h-index
2 publications
62 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
258 citations
1–8 of 49
6 publications · 135 citations
6
h-index
4 publications · 217 citations
4
h-index
3 publications · 93 citations
3
h-index
2 publications · 30 citations
2
h-index
2 publications · 182 citations
2
h-index
1–5