Connectivity keeping paths in k-connected graphs (Q3055926): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Critically n-Connected Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity keeping edges in graphs with large minimum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On critically h-connected simple graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eine Eigenschaft der Atome endlicher Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: High connectivity keeping sets in \(n\)-connected graphs / rank | |||
Normal rank |
Latest revision as of 11:38, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connectivity keeping paths in k-connected graphs |
scientific article |
Statements
Connectivity keeping paths in k-connected graphs (English)
0 references
10 November 2010
0 references
k-connected graph
0 references
paths
0 references
fragment
0 references
semifragment
0 references