Contractible edges in 3-connected graphs (Q1087557): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(87)90065-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2033985129 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4187840 / 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: Zur Theorie der n-fach zusammenhängenden Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3284374 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circuits containing specified edges / rank | |||
Normal rank | |||
Latest revision as of 17:22, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Contractible edges in 3-connected graphs |
scientific article |
Statements
Contractible edges in 3-connected graphs (English)
0 references
1987
0 references
An edge whose contraction results in a 3-connected graph is called a contractible edge. Using two theorems of \textit{R. Halin} [Math. Ann. 182, 175-188 (1969; Zbl 0175.505); Abh. Sem. Univ. Hamburg 33, 133-163 (1969; Zbl 0175.505)] it is easy to see that every 3-connected graph G of order least five has \(\lceil (| G| +3)/5\rceil\) or more contractible edges. The authors improved this bound to \(\lceil | G| /2\rceil\) and characterizes those 3-connected graphs which attain the equality.
0 references
contractible edges
0 references
