Endlichkeitssätze für k-kritische Graphen
From MaRDI portal
Publication:1229889
DOI10.1007/BF01351600zbMath0337.05131MaRDI QIDQ1229889
Publication date: 1977
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/163010
Related Items (11)
Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs) ⋮ Generalizaions of critical connectivity of graphs ⋮ There exist highly critically connected graphs of diameter three ⋮ On \(k\)-con-critically \(n\)-connected graphs ⋮ On critically h-connected simple graphs ⋮ Indestructive deletions of edges from graphs ⋮ On a conjecture of Entringer and Slater ⋮ Extremal infinite graph theory ⋮ A connected subgraph maintaining high connectivity ⋮ Contractible non-edges in \(3\)-connected graphs ⋮ High connectivity keeping sets in graphs and digraphs
Cites Work
- Über n-fach zusammenhängende Eckenmengen in Graphen
- Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
- 1-Faktoren von Graphen. (1-factors of graphs)
- Connectivity of transitive graphs
- Eine Eigenschaft der Atome endlicher Graphen
- Unnamed Item
- Unnamed Item
This page was built for publication: Endlichkeitssätze für k-kritische Graphen
