There exist highly critically connected graphs of diameter three (Q882783): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00373-006-0672-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2171038021 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4947393 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Endlichkeitssätze für k-kritische Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3220626 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On \(k\)-con-critically \(n\)-connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On k-critical, n-connected graphs / rank | |||
Normal rank |
Latest revision as of 19:58, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | There exist highly critically connected graphs of diameter three |
scientific article |
Statements
There exist highly critically connected graphs of diameter three (English)
0 references
24 May 2007
0 references
Critical connectivity
0 references