Graphic matroid

Known as: Cycle, Cycle matroid, Graphical matroid 
In matroid theory, a discipline within mathematics, a graphic matroid (also called a cycle matroid or polygon matroid) is a matroid whose independent… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… (More)
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Multilocus Sequence Typing (MLST) is a frequently used typing method for the analysis of the clonal relationships among strains… (More)
  • table 1
Is this relevant?
2008
2008
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2008
Review
2008
This paper deals with distribution network (DN) reconfiguration for loss minimization. To solve this combinatorial problem, a… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study a generalization of the classical secretary problem which we call the "matroid secretary problem". In this problem, the… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We study the Bergman complex B(M) of a matroid M : a polyhedral complex which arises in algebraic geometry, but which we describe… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Answering a question of Geelen, Gerards, Robertson and Whittle [1], we prove that the branchwidth of a bridgeless graph is equal… (More)
Is this relevant?
2003
2003
A relatively simple proof is presented for the min-max theorem of Lovász on the graphic matroid parity problem. 
Is this relevant?
2002
2002
A nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/e is graphic. We determine completely… (More)
  • figure 1
  • figure 2
  • table I
  • table III
  • table IV
Is this relevant?
1992
1992
This paper introduces a linear relaxation of the matroid matching problem, called the fractional matroid matching problem. When… (More)
  • figure 1
Is this relevant?