The \(k\)-subconnectedness of planar graphs (Q2133309): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4393242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several sorts of connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2948062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for cyclic vertex connectivity of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sufficient Degree Conditions for a Graph to be $k$-linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of \(k\)-subconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank

Revision as of 19:56, 28 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-subconnectedness of planar graphs
scientific article

    Statements

    The \(k\)-subconnectedness of planar graphs (English)
    0 references
    0 references
    0 references
    29 April 2022
    0 references
    \(k\)-connected graph
    0 references
    independent paths
    0 references
    planar graph
    0 references
    \(k\)-subconnected graph
    0 references
    component
    0 references

    Identifiers