An upper bound for the radius of a 3-connected graph (Q1313873): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: On the radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:58, 22 May 2024

scientific article
Language Label Description Also known as
English
An upper bound for the radius of a 3-connected graph
scientific article

    Statements

    An upper bound for the radius of a 3-connected graph (English)
    0 references
    0 references
    19 May 1994
    0 references
    0 references
    3-connected graph
    0 references
    radius
    0 references
    0 references
    0 references