The number of removable edges in 3-connected graphs
From MaRDI portal
Publication:1306424
DOI10.1006/jctb.1998.1864zbMath0931.05044OpenAlexW4213242103MaRDI QIDQ1306424
Publication date: 23 February 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1864
Related Items (9)
Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Removable edges of cycles in 5-connected graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs ⋮ The minimum number of minimal codewords in an \([n, k\)-code and in graphic codes] ⋮ Contractible and removable edges in 3-connected infinite graphs
Cites Work
This page was built for publication: The number of removable edges in 3-connected graphs
