The \(k\)-in-a-path problem for claw-free graphs (Q2428671): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting even holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding induced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-in-a-tree problem in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3034816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Packing of Odd Cycles in a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordless paths through three vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding χ in terms of ω and Δ for quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Disjoint Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-tree problem for graphs of girth at least \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Paths of Given Parity in Claw-Free Graphs / rank
 
Normal rank

Latest revision as of 03:37, 5 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-in-a-path problem for claw-free graphs
scientific article

    Statements

    The \(k\)-in-a-path problem for claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    induced path
    0 references
    claw-free graph
    0 references
    polynomial time algorithm
    0 references
    0 references