scientific article; zbMATH DE number 3301261
From MaRDI portal
Publication:5582910
Cited in
(27)- Unions of oriented matroids
- The principal partition of a pair of graphs and its applications
- The Euler circuit theorem for binary matroids
- On the structures induced by bipartite graphs and infinite matroids
- An extension of Tutte's 1-factor theorem
- A note on list arboricity
- Exchange systems
- Equicovering matroids by distinct bases
- Semidirect sums of matroids
- Submodular functions and independence structures
- A matroid generalization of a theorem of Mendelsohn and Dulmage
- The rank formula of Nash-Williams as a source of covering and packing theorems
- Computing pure Nash and strong equilibria in bottleneck congestion games
- On the reconstruction of locally finite trees
- Axioms for infinite matroids
- Graph reconstruction—a survey
- Anti-Ramsey number of edge-disjoint rainbow spanning trees
- scientific article; zbMATH DE number 3298861 (Why is no real title available?)
- Matroids and linking systems
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
- Count and cofactor matroids of highly connected graphs
- An extension of Nash-Williams and Tutte's theorem
- Dominic Welsh: his work and influence
- Faster matroid partition algorithms
- Tropical geometry of Rado matroids
- The k-path tree matroid and its applications to survivable network design
- Brick partitions of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5582910)
