An Algorithm for Determining Whether a Given Binary Matroid is Graphic

Cited in

(50)

On the representability of totally unimodular matrices on bidirected graphs
A very personal reminiscence on the problem of computational complexity
Algorithmic aspects of intersection graphs and representation hypergraphs
An efficient PQ-graph algorithm for solving the graph-realization problem
Separating cocircuits in binary matroids
Recognizing graphic matroids
Computational implementation of Fujishige's graph realizability algorithm
The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.
Distance realization problems with applications to internet tomography
Matrices over finite fields and their Kirchhoff graphs
On the efficiency of representability tests for matroids
Independence and port oracles for matroids, with an application to computational learning theory
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
Binary signed-graphic matroids: representations and recognition algorithms
Signed-graphic matroids with all-graphic cocircuits
On Okada's method for realizing cut-set matrices
On the decomposition of a complete graph into planar subgraphs
Stabilizer theorems for even cycle matroids
Recognizing binet matrices
An Introduction to Coding Sequences of Graphs
First order convergence of matroids
Extended formulations for independence polytopes of regular matroids
Binary group and Chinese postman polyhedra
Single Commodity Representation of Multicommodity Networks
Graphic matroids and the multicommodity transportation problem
Recognizing Polymatroids Associated with Hypergraphs
Characterizing graphic matroids by a system of linear equations
Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
On Four Problems in Graph Theory
Displaying blocking pairs in signed graphs
Nonseparating Cocircuits in Binary Matroids
Recognizing Even-Cycle and Even-Cut Matroids
Even circuits in oriented matroids
The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
Schottky algorithms: Classical meets tropical
scientific article; zbMATH DE number 3298861 (Why is no real title available?)
On internally 4-connected non-regular binary matroids
Recognizing even-cycle and even-cut matroids
From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
Small separations in pinch-graphic matroids
Recognizing pinch-graphic matroids
The complexity of the matroid homomorphism problem
Decomposition of quaternary signed-graphic matroids
Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
Bond graphs. III: Bond graphs and electrical networks
Primal-dual approximation algorithms for integral flow and multicut in trees
A mathematical programming approach for recognizing binet matrices
Exact algorithms and applications for tree-like Weighted Set Cover
A new characterization of graphic matroids
On Mighton's characterization of graphic matroids

This page was built for publication: An Algorithm for Determining Whether a Given Binary Matroid is Graphic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3277098)