Depth first search in claw-free graphs (Q1744633): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2686495582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning spiders and light-splitting switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in 5-connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest paths and cycles in K1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding spanning trees with few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank

Latest revision as of 12:21, 15 July 2024

scientific article
Language Label Description Also known as
English
Depth first search in claw-free graphs
scientific article

    Statements

    Depth first search in claw-free graphs (English)
    0 references
    0 references
    19 April 2018
    0 references
    claw-free graph
    0 references
    spanning tree
    0 references
    depth first search
    0 references

    Identifiers