The number of contractible edges in 3-connected graphs
From MaRDI portal
Publication:1111571
DOI10.1007/BF01864172zbMath0658.05047OpenAlexW2001082365MaRDI QIDQ1111571
Publication date: 1988
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01864172
Related Items (6)
Contractible edges in longest cycles in non-Hamiltonian graphs ⋮ Properly 3-contractible edges in a minimally 3-connected graph ⋮ Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge ⋮ Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph ⋮ Contractible edges and removable edges in 3-connected graphs ⋮ Unnamed Item
Cites Work
This page was built for publication: The number of contractible edges in 3-connected graphs
