Finding induced paths of given parity in claw-free graphs (Q2428656): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q191506
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marcin Kaminski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2116786738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of cycles and paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the group path problem on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the parity path problem on perfectly orientable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient reduction for path problems on circular-arc graphs / rank
 
Normal rank
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: Recognizing Berge graphs / 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: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-colourable perfect graphs without even pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable set bonding in perfect graphs and parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding induced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path parity and perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even and odd pairs in comparability and in \(P_4\)-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations which Preserve Perfectness and H-Perfectness of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on clique separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Perfect 2-Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The even-path problem for graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even pairs in claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A description of claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new property of critical imperfect graphs and some consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parity path problem on some subclasses of perfect graphs / 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: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686753 / rank
 
Normal rank

Latest revision as of 02:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Finding induced paths of given parity in claw-free graphs
scientific article

    Statements

    Finding induced paths of given parity in claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    induced path
    0 references
    parity path
    0 references
    claw-free graph
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers