Zur Struktur minimal n-fach zusammenhängender Graphen (Q1256495): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schnittverbände in Graphen. (Intersection lattices in graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über trennende Eckenmengen in Graphen und den Mengerschen Satz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on n-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of N‐connected graphs with prescribed degrees (n ≧ 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02950646 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2320477734 / rank
 
Normal rank

Latest revision as of 11:47, 30 July 2024