An Algorithm for Determining Whether a Given Binary Matroid is Graphic
From MaRDI portal
Publication:3277098
DOI10.2307/2034435zbMath0097.38905OpenAlexW4240485950WikidataQ56430156 ScholiaQ56430156MaRDI QIDQ3277098
Publication date: 1961
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2034435
Related Items
Single Commodity Representation of Multicommodity Networks, Recognizing Even-Cycle and Even-Cut Matroids, A very personal reminiscence on the problem of computational complexity, Even circuits in oriented matroids, Binary group and Chinese postman polyhedra, Recognizing binet matrices, First order convergence of matroids, Extended formulations for independence polytopes of regular matroids, Recognizing Polymatroids Associated with Hypergraphs, Exact algorithms and applications for tree-like Weighted Set Cover, Algorithmic aspects of intersection graphs and representation hypergraphs, On internally 4-connected non-regular binary matroids, Signed-graphic matroids with all-graphic cocircuits, 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, Recognizing even-cycle and even-cut matroids, The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids, From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals, An efficient PQ-graph algorithm for solving the graph-realization problem, Small separations in pinch-graphic matroids, Recognizing pinch-graphic matroids, An Introduction to Coding Sequences of Graphs, The complexity of the matroid homomorphism problem, Separating cocircuits in binary matroids, Schottky algorithms: Classical meets tropical, The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor., Characterizing graphic matroids by a system of linear equations, Recognizing graphic matroids, Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover, Unnamed Item, Displaying blocking pairs in signed graphs, Bond graphs. III: Bond graphs and electrical networks, Primal-dual approximation algorithms for integral flow and multicut in trees, Matrices over finite fields and their Kirchhoff graphs, A new characterization of graphic matroids, On Mighton's characterization of graphic matroids, Graphic matroids and the multicommodity transportation problem, On Okada's method for realizing cut-set matrices, On the decomposition of a complete graph into planar subgraphs, On Four Problems in Graph Theory, On the efficiency of representability tests for matroids, On the representability of totally unimodular matrices on bidirected graphs, Computational implementation of Fujishige's graph realizability algorithm, Nonseparating Cocircuits in Binary Matroids, Distance realization problems with applications to internet tomography, Stabilizer theorems for even cycle matroids
