The radius of \(k\)-connected planar graphs with bounded faces (Q1759405): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5461702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges in a bipartite graph of given radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2761046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius, diameter, and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the radius of a 3-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the radius of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5426679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541882 / rank
 
Normal rank

Latest revision as of 22:26, 5 July 2024

scientific article
Language Label Description Also known as
English
The radius of \(k\)-connected planar graphs with bounded faces
scientific article

    Statements

    The radius of \(k\)-connected planar graphs with bounded faces (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2012
    0 references
    0 references
    radius
    0 references
    distance
    0 references
    planar graph
    0 references
    0 references