Minimal cycle bases of outerplanar graphs (Q1381672): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q592071
RedirectionBot (talk | contribs)
Changed an Item
Property / reviewed by
 
Property / reviewed by: Wai-Kai Chen / rank
 
Normal rank

Revision as of 04:11, 20 February 2024

scientific article
Language Label Description Also known as
English
Minimal cycle bases of outerplanar graphs
scientific article

    Statements

    Minimal cycle bases of outerplanar graphs (English)
    0 references
    0 references
    0 references
    1 April 1998
    0 references
    It is shown that for 2-connected outerplanar graphs there is a unique cycle basis with length \(2| E| -| V|\), where \(E\) is the edge set and \(V\) the vertex set. They are the only Hamiltonian graphs with a cycle basis of this length.
    0 references
    connectivity
    0 references
    outerplanar graphs
    0 references
    cycle basis
    0 references
    Hamiltonian graphs
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references