Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs (Q2488209): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed version of Menger's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed connectivity certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse subgraphs preserving connectivity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimally \((n,\lambda)\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad und lokaler Zusammenhang in endlichen Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kreuzungsfreie a,b-Wege in endlichen Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity and its augmentation: Applications of MA orderings / rank
 
Normal rank

Latest revision as of 15:33, 10 June 2024

scientific article
Language Label Description Also known as
English
Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
scientific article

    Statements

    Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs (English)
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    0 references
    Connectivity of graphs
    0 references
    MA ordering
    0 references
    Removable cycle
    0 references
    0 references