The Klee and Quaife minimum (d, 1, 3)-graphs revisited (Q3866154): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1109/tcs.1980.1084800 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094996634 / rank
 
Normal rank

Latest revision as of 11:48, 30 July 2024

scientific article
Language Label Description Also known as
English
The Klee and Quaife minimum (d, 1, 3)-graphs revisited
scientific article

    Statements

    The Klee and Quaife minimum (d, 1, 3)-graphs revisited (English)
    0 references
    0 references
    1980
    0 references
    0 references
    0 references
    0 references
    0 references
    survivable communication network
    0 references
    switching centers
    0 references
    messages
    0 references
    minimum graphs
    0 references
    minimum cubic graphs
    0 references
    diameter
    0 references
    connectivity
    0 references
    associated pseudographs
    0 references
    nonseparable minimum blocks
    0 references
    bridge tree
    0 references
    cut-diameter graph
    0 references
    0 references