Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,874,058 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
40 relations
Bicircular matroid
Binary matroid
Branch-decomposition
Circuit rank
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The Sequence x 3 [Graphic Design]
D. Page
2019
Corpus ID: 198337516
2014
2014
The magnitude of a graph Tom Leinster
T. Leinster
2014
Corpus ID: 84836905
The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler…
Expand
2013
2013
Infinite graphic matroids Part I
N. Bowler
,
J. Carmesin
,
Robin Christian
2013
Corpus ID: 118132186
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is…
Expand
2013
2013
The graphicity of the sum of graphic matroids
Csongor György Csehi
2013
Corpus ID: 54736783
There is a conjecture that if the sum of graphic matroids is not graphic then it is nonbinary [5]. Some special cases have been…
Expand
2012
2012
A matroid view of key theorems for edge-swapping algorithms
Jon Lee
,
Leo Liberti
Math. Methods Oper. Res.
2012
Corpus ID: 46770970
We demonstrate that two key theorems of Amaldi et al. (Math Methods Oper Res 69:205–223, 2009), which they presented with rather…
Expand
2011
2011
Геометрия поперечного сечения поверхностей вращения, обработанных фрезерованием
Михаил Васильевич Грязев
,
А. В. Степаненко
2011
Corpus ID: 75036679
Analytical dependences are found in article for definition of an error of processing as functions from a combination of…
Expand
2009
2009
UNAVOIDABLE PARALLEL MINORS OF REGULAR MATROIDS
2009
Corpus ID: 261859456
2008
2008
Least Squares Methods for Equidistant Tree Reconstruction
Conor Fahey
,
Serkan Hoşten
,
Nathan Krieger
,
L. Timpe
2008
Corpus ID: 16766512
UPGMA is a heuristic method identifying the least squares equidistant phylogenetic tree given empirical distance data among $n…
Expand
2002
2002
The Mathematical Foundations of Bondgraphs VI Causality and Regularity for Directed Bondgraphs
S. Birkett
2002
Corpus ID: 10730409
This article concludes a series on the mathematical foundations of bondgraphs an abstraction of the concept of bondgraph junction…
Expand
1966
1966
Graphic Design and Visual Communication
J. D. Voss
,
John W. Cataldo
1966
Corpus ID: 196124807