A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (Q2424828): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128235512, #quickstatements; #temporary_batch_1726270017965
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Uniform cyclic edge connectivity in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclic edge-connectivity of fullerenes / 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: A polynomial time algorithm for cyclic vertex connectivity of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2948062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge reductions in cyclically \(k\)-connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several sorts of connectivity / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128235512 / rank
 
Normal rank

Latest revision as of 01:38, 14 September 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
scientific article

    Statements

    A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    cyclic vertex connectivity
    0 references
    4-regular graph
    0 references
    maximum flow
    0 references
    time complexity
    0 references

    Identifiers