scientific article
From MaRDI portal
Publication:3220626
zbMath0556.05044MaRDI QIDQ3220626
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Connectivity (05C40)
Related Items (18)
A chain theorem for 4-connected graphs ⋮ Reductions of 3-connected graphs with minimum degree at least four ⋮ Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) ⋮ How to contract an essentially 6-connected graph to a 5-connected graph ⋮ Generalizaions of critical connectivity of graphs ⋮ On the existence of \((k,l)\)-critical graphs ⋮ On \(k\)-critical connected line graphs ⋮ There exist highly critically connected graphs of diameter three ⋮ On \(k\)-con-critically \(n\)-connected graphs ⋮ Connectivity keeping edges in graphs with large minimum degree ⋮ On locally \(k\)-critically \(n\)-connected graphs ⋮ Removable edges in a 5-connected graph and a construction method of 5-connected graphs ⋮ A connected subgraph maintaining high connectivity ⋮ A combinatorial characterization of finite groups of prime exponent ⋮ The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) ⋮ High connectivity keeping sets in graphs and digraphs ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected ⋮ Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
This page was built for publication:
