Parameterized complexity of induced graph matching on claw-free graphs (Q487013): 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: Independent packings in structured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. I: Orientable prismatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. II: Non-orientable prismatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. III: Circular interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. IV: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. VI: Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. VII. Quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating set is fixed parameter tractable in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster fixed-parameter tractable algorithms for matching and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced disjoint paths in AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Disjoint Paths in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraph isomorphism on proper interval and bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Induced H-Matching on Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination When the Stars Are Out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743381 / 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: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-Color / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal Helly circular-arc graphs and its subclasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted circular-arc graphs and clique cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Problem Kernelization for Graph Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of fuzzy circular interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / 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: Efficient graph representations / rank
 
Normal rank

Latest revision as of 12:25, 9 July 2024

scientific article
Language Label Description Also known as
English
Parameterized complexity of induced graph matching on claw-free graphs
scientific article

    Statements

    Parameterized complexity of induced graph matching on claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 2015
    0 references
    algorithms and data structures
    0 references
    induced matchings
    0 references
    claw-free graphs
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references