A new approach on locally checkable problems (Q2127611): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q831860
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3114856694 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2006.00681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triple Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5354542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the double Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer independent double Roman domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal double Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the lucky choice number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Roman domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum chromatic violation problem: a polyhedral study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total dominating sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow domination on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lucky labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect double Roman domination of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-\(d\) independent set problems for bipartite and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the packing coloring problem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and average distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited packings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2878209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Total {k}-Domination and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: $$\{k\}$$-Packing Functions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent double Roman domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All structured programs have small tree width and good register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank

Latest revision as of 17:04, 28 July 2024

scientific article
Language Label Description Also known as
English
A new approach on locally checkable problems
scientific article

    Statements

    A new approach on locally checkable problems (English)
    0 references
    20 April 2022
    0 references
    locally checkable problem
    0 references
    vertex partitioning problem
    0 references
    local condition composition problem
    0 references
    \( [ k ]\)-Roman domination
    0 references
    Grundy domination
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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