A characterization of graphic matroids based on circuit orderings

DOI10.1137/17M1119202MaRDI QIDQ4643301zbMATH OpenWikidataFDO

Authors Donald K. Wagner

Publication date 24 May 2018

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

binary matroidsgraphic matroidscircuit orderings

Mathematics Subject Classification ID

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)

Recommendations

• A circuit characterization of graphic matroids
• Ordering circuits of matroids
• A new characterization of graphic matroids
• New approaches to the graphicness of a matroid
• A characterization of graphic matroids using non-separating cocircuits

Cites work

• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 3719168 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3288399 (Why is no real title available?)
• A characterization of graphic matroids using non-separating cocircuits
• A circuit characterization of graphic matroids
• A new characterization of graphic matroids
• A planarity criterion for graphs
• A strengthened form of Tutte's characterization of regular matroids
• An Almost Linear-Time Algorithm for Graph Realization
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Characterizing 3-connected planar graphs and graphic matroids
• Characterizing graphic matroids by a system of linear equations
• Converting Linear Programs to Network Problems
• Decomposition of regular matroids
• Graphs, matroids, and geometric lattices
• Kuratowski's and Wagner's theorems for matroids
• Lectures on matroids
• On Mighton's characterization of graphic matroids
• On even matroids
• Une rélation de séparation entre cocircuits d'un matroide

Cited in

(11)

• Characterizing 3-connected planar graphs and graphic matroids
• Characterizing graphic matroids by a system of linear equations
• The graphicity of the union of graphic matroids
• A characterization of the base-matroids of a graphic matroid
• A constructive characterisation of circuits in the simple (2,1)-sparse matroid
• Chordal characterization of graphic matroids
• A new characterization of graphic matroids
• A circuit characterization of graphic matroids
• On Tutt's Characterization of graphic matroids—a graphic proof
• Triples in matroid circuits
• Ordering circuits of matroids

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)