Algorithm for two disjoint long paths in 2-connected graphs (Q986559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Path of Superlogarithmic Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding long paths and cycles in sparse Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonism, degree sum and neighborhood intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for long paths in graphs / rank
 
Normal rank

Latest revision as of 02:30, 3 July 2024

scientific article
Language Label Description Also known as
English
Algorithm for two disjoint long paths in 2-connected graphs
scientific article

    Statements

    Algorithm for two disjoint long paths in 2-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    path
    0 references
    degree sum
    0 references
    dominating path
    0 references
    0 references