Characterization of minimally \((2,l)\)-connected graphs (Q1944218): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Generalization of Line Connectivity and Optimally Invulnerable Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4830805 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimally 2-edge connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimally 2-connected graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3898529 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3953800 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimally (<i>k, k</i>)‐edge‐connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4243806 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the \(\ell\)-connectivity of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Minimal Blocks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3620525 / rank | |||
Normal rank |
Revision as of 07:41, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterization of minimally \((2,l)\)-connected graphs |
scientific article |
Statements
Characterization of minimally \((2,l)\)-connected graphs (English)
0 references
4 April 2013
0 references
combinatorial problems
0 references
connectivity
0 references
minimally \(k\)-connected graphs
0 references
\(l\)-connectivity
0 references
\((k,l)\)-connected graphs
0 references
minimally \((2,l)\)-connected graphs
0 references