scientific article; zbMATH DE number 3313442
From MaRDI portal
Publication:5593828
zbMath0197.00802MaRDI QIDQ5593828
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the first-order edge tenacity of a graph, Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs, Parameterized algorithms for non-separating trees and branchings in digraphs, Spanning Rigid Subgraph Packing and Sparse Subgraph Covering, Bracing cubic grids - a necessary condition, Computing pure Nash and strong equilibria in bottleneck congestion games, Axioms for infinite matroids, Layers and matroids for the traveling salesman's paths, Packing of rigid spanning subgraphs and spanning trees, Additive stabilizers for unstable graphs, Linking rigid bodies symmetrically, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs, A deterministic parallel reduction from weighted matroid intersection search to decision, Beating the Integrality Ratio for $s$-$t$-Tours in Graphs, Network theory and transversal matroids, Count and cofactor matroids of highly connected graphs, On resolvability of a graph associated to a finite vector space, Arc-disjoint paths and trees in 2-regular digraphs, Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees, Two packing problems on \(k\)-matroid trees, A Weighted Linear Matroid Parity Algorithm, Applications of combinatorics to statics --- a second survey, Brick partitions of graphs, Criteria of the \(k\)-singularity and division of 1-singular systems, Intervals in matroid basis graphs, An analysis of approximations for maximizing submodular set functions—I, Linear matroid intersection is in quasi-NC, Chords and disjoint paths in matroids, Matroids on partially ordered sets, Pfaffian pairs and parities: counting on linear matroid intersection and parity problems, The Tutte polynomial of a ported matroid, Packing of Steiner trees and \(S\)-connectors in graphs, On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs, Decomposition into two trees with orientation constraints, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, Algorithms for the minimum weight of linear codes
