Proof of Mader's conjecture on k‐critical n‐connected graphs
From MaRDI portal
Publication:4459607
Recommendations
- scientific article; zbMATH DE number 1002446
- Mader's conjecture on extremely critical graphs
- scientific article; zbMATH DE number 4101236
- On \(k\)-con-critically \(n\)-connected graphs
- Mader's conjecture for graphs with small connectivity
- Proof of a conjecture on connectivity of Kronecker product of graphs
- Critically (k,k)-connected graphs
- scientific article; zbMATH DE number 68915
- scientific article; zbMATH DE number 3885951
- On connected \((\gamma,k)\)-critical graphs
Cites work
Cited in
(11)- Mader's conjecture on extremely critical graphs
- On \(k\)-con-critically \(n\)-connected graphs
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Counterexamples to a conjecture of Mader about cycles through specified vertices in \(n\)-edge-connected graphs
- Fragments in kcritical n‐connected graphs
- High connectivity keeping sets in graphs and digraphs
- Mader's conjecture for graphs with small connectivity
- scientific article; zbMATH DE number 4183446 (Why is no real title available?)
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- scientific article; zbMATH DE number 4101236 (Why is no real title available?)
This page was built for publication: Proof of Mader's conjecture on k‐critical n‐connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459607)