A characterization of graphic matroids based on circuit orderings
DOI10.1137/17M1119202zbMATH Open1387.05041WikidataQ129774606 ScholiaQ129774606MaRDI QIDQ4643301FDOQ4643301
Publication date: 24 May 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Planar graphs; geometric and topological aspects of graph theory (05C10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Decomposition of regular matroids
- Kuratowski's and Wagner's theorems for matroids
- A characterization of graphic matroids using non-separating cocircuits
- A circuit characterization of graphic matroids
- Characterizing 3-connected planar graphs and graphic matroids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizing graphic matroids by a system of linear equations
- Title not available (Why is that?)
- Lectures on matroids
- On even matroids
- Title not available (Why is that?)
- Graphs, matroids, and geometric lattices
- Une rélation de séparation entre cocircuits d'un matroide
- A new characterization of graphic matroids
- Converting Linear Programs to Network Problems
- An efficient PQ-graph algorithm for solving the graph-realization problem
- An Almost Linear-Time Algorithm for Graph Realization
- On Mighton's characterization of graphic matroids
- A Planarity Criterion for Graphs
- A strengthened form of Tutte's characterization of regular matroids
Cited In (6)
This page was built for publication: A characterization of graphic matroids based on circuit orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643301)
