Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs)

DOI10.1016/0095-8956(88)90054-8zbMath0657.05050OpenAlexW2033487690MaRDI QIDQ1110537

W. Mader

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90054-8

zbMATH Keywords

cordinalityk-critically n-connected graphsnoncomplete graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

Generalizaions of critical connectivity of graphs

Cites Work

• Unnamed Item
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• On multiply critically h-connected graphs
• On a conjecture of Entringer and Slater
• Endlichkeitssätze für k-kritische Graphen
• On k-critical, n-connected graphs
• Eine Eigenschaft der Atome endlicher Graphen

This page was built for publication: Über \((k+1)\)-kritisch \((2k+1)\)-fach zusammenhängende Graphen. (On \((k+1)\)-critically \((2k+1)\)-connected graphs)