Construction sequences and certifying 3-connectivity (Q2428654): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-010-9450-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060387448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking geometric programs or verification of geometric structures / 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: Construction Sequences and Certifying 3-Connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kuratowski's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding triconnected components of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>E</i> <sub>11</sub> and M theory / rank
 
Normal rank

Latest revision as of 03:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Construction sequences and certifying 3-connectivity
scientific article

    Statements

    Construction sequences and certifying 3-connectivity (English)
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    algorithms and data structures
    0 references
    construction sequence
    0 references
    3-connected
    0 references
    certifying algorithm
    0 references
    Tutte contraction
    0 references
    removable edges
    0 references
    0 references