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

Authors

82

  1. DS
    Daniel Slilaty

    Wright State University, United States

    4 publications · 60 citations

    4

    h-index

  2. GW
    Geoff Whittle

    Victoria University of Wellington, New Zealand

    3 publications · 89 citations

    3

    h-index

  3. HN
    Harold N. Gabow

    University of Colorado Boulder, United States

    3 publications · 149 citations

    3

    h-index

  4. HQ
    Hongxun Qin

    George Washington University, United States

    2 publications · 27 citations

    2

    h-index

  5. NI
    Nicole Immorlica

    Microsoft (United States), United States

    2 publications · 258 citations

    2

    h-index

1–5 of 82

Venues

  1. Discrete Mathematics

    6 publications · 135 citations

    6

    h-index

  2. SIAM Journal on Discrete Mathematics

    4 publications · 217 citations

    4

    h-index

  3. Journal of Combinatorial Theory Series B

    3 publications · 93 citations

    3

    h-index

  4. Journal of Graph Theory

    2 publications · 30 citations

    2

    h-index

  5. European Journal of Combinatorics

    2 publications · 182 citations

    2

    h-index

1–5