Counterexamples to theorems of Menger type for the diameter (Q1838498): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q790131 / rank
Normal rank
 
Property / author
 
Property / author: Pavol Hell / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124881004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs as models of communication network vulnerability: Connectivity and persistence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture on paths of bounded length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mengerian theorems for paths of bounded length / rank
 
Normal rank

Latest revision as of 18:31, 13 June 2024

scientific article
Language Label Description Also known as
English
Counterexamples to theorems of Menger type for the diameter
scientific article

    Statements

    Counterexamples to theorems of Menger type for the diameter (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    vulnerability in communication networks
    0 references
    persistence of graphs
    0 references
    Menger- type results
    0 references
    diameter
    0 references
    0 references