On Connectivity in Matroids and Graphs (Q3937421): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
label / en | label / en | ||
On Connectivity in Matroids and Graphs | |||
Property / author | |||
Property / author: James G. Oxley / rank | |||
Property / author | |||
Property / author: James G. Oxley / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.2307/1998480 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2496286765 / rank | |||
Normal rank | |||
Property / title | |||
On Connectivity in Matroids and Graphs (English) | |||
Property / title: On Connectivity in Matroids and Graphs (English) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871771 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Combinatorial Model for Series-Parallel Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Foundations of Combinatorial Theory II. Combinatorial Geometries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimally 2-connected graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4143304 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4189309 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal critically connected matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: COLOURING, PACKING AND THE CRITICAL PROBLEM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a covering problem of Mullin and Stanton for binary matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON MATROID CONNECTIVITY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On 3-Connected Matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Minimal Blocks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matroid representation over GF(3) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing and covering with matroid circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of regular matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity in Matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the chromatic number of binary matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111952 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Bracket Ring of a Combinatorial Geometry. II: Unimodular Geometries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On certain n-connected matroids. / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:13, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Connectivity in Matroids and Graphs |
scientific article |
Statements
1981
0 references
2-connected matroid
0 references
minimally 2-connected graph
0 references
On Connectivity in Matroids and Graphs (English)
0 references