The following pages link to Donald K. Wagner (Q170031):
Displaying 34 items.
- A circuit characterization of graphic matroids (Q257006) (← links)
- Delta-wye reduction of almost-planar graphs (Q476317) (← links)
- (Q579124) (redirect page) (← links)
- A note on detecting simple redundancies in linear systems (Q579125) (← links)
- A polynomial-time simplex method for the maximum \(k\)-flow problem (Q688924) (← links)
- Equivalent factor matroids of graphs (Q753823) (← links)
- On Mighton's characterization of graphic matroids (Q974476) (← links)
- On the complexity of recognizing a class of generalized networks (Q1058995) (← links)
- Connectivity in bicircular matroids (Q1070236) (← links)
- On theories of Whitney and Tutte (Q1070237) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- Representations of bicircular matroids (Q1179188) (← links)
- Uncovering generalized-network structure in matrices (Q1308737) (← links)
- On the \(k\)-cut subgraph polytope (Q1340072) (← links)
- Bipartite and Eulerian minors (Q1671743) (← links)
- A note on immersion minors and planarity (Q1744743) (← links)
- The arborescence-realization problem (Q1893159) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- Graphs with no \(K_{3,3}\) minor containing a fixed edge (Q1953665) (← links)
- Recognizing a class of bicircular matroids (Q2367405) (← links)
- Decomposition of 3-connected graphs (Q2367440) (← links)
- \(K_{3,3}\) minors and the maximum-flow problem (Q2867319) (← links)
- Forbidden subgraphs and graph decomposition (Q3781793) (← links)
- An Almost Linear-Time Algorithm for Graph Realization (Q3800056) (← links)
- Vertex 2-isomorphism (Q4014273) (← links)
- (Q4273875) (← links)
- On the Consecutive-Retrieval Problem (Q4291565) (← links)
- Minimum-weighted cycles in 3-separable graphs (Q4347282) (← links)
- A Characterization of Graphic Matroids Based on Circuit Orderings (Q4643301) (← links)
- Disjoint (<i>s, t</i>)‐cuts in a network (Q4712978) (← links)
- Nonseparating Cocircuits in Binary Matroids (Q5020847) (← links)
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (Q5287453) (← links)
- Weakly 3-Connected Graphs (Q5295405) (← links)
- Shortest paths in almost acyclic graphs (Q5929143) (← links)
