Centering a spanning tree of a biconnected graph (Q1123632): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Stephen T. Hedetniemi / rank
Normal rank
 
Property / author
 
Property / author: Stephen T. Hedetniemi / rank
 
Normal rank
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.1016/0020-0190(89)90051-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966734270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3676066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of a centroid of a free tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:09, 20 June 2024

scientific article
Language Label Description Also known as
English
Centering a spanning tree of a biconnected graph
scientific article

    Statements

    Centering a spanning tree of a biconnected graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    spanning tree algorithm
    0 references
    biconnected graph
    0 references
    center
    0 references

    Identifiers