NP-completeness results for partitioning a graph into total dominating sets (Q5918107): 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: W3023108549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deploying Robots With Two Sensors in<i>K</i><sub>1, 6</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel bounds for disjoint cycles and disjoint paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coupon colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the decomposability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster graph coloring in polynomial space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering wireless ad hoc networks with weakly connected dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domatic number problem on some perfect graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for partitioning a graph into total dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion/exclusion meets measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domatic Partition on Several Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupon coloring of some special graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in generalized Petersen graphs / rank
 
Normal rank

Latest revision as of 07:28, 22 July 2024

scientific article; zbMATH DE number 7187633
Language Label Description Also known as
English
NP-completeness results for partitioning a graph into total dominating sets
scientific article; zbMATH DE number 7187633

    Statements

    NP-completeness results for partitioning a graph into total dominating sets (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2020
    0 references
    total domatic number
    0 references
    graph theory
    0 references
    computational complexity
    0 references
    combinatorics
    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