Dominating set is fixed parameter tractable in claw-free graphs (Q650938): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005475011 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.6239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization problems in multiple-interval graphs / 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: Q4385531 / 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: Domination Problems in Nowhere-Dense Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dominating set problem is fixed parameter tractable for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination When the Stars Are Out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284545 / rank
 
Normal rank

Latest revision as of 17:05, 4 July 2024

scientific article
Language Label Description Also known as
English
Dominating set is fixed parameter tractable in claw-free graphs
scientific article

    Statements

    Dominating set is fixed parameter tractable in claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2011
    0 references
    fixed parameter tractability
    0 references
    dominating set
    0 references
    claw-free graphs
    0 references
    clique
    0 references
    connected dominating set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers