Complexity of conflict-free colorings of graphs (Q484316): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.11.029 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033159765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Conflict-Free Colouring for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph unique-maximum and conflict-free colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conflict-free coloring for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-Width is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of coloring problems: treewidth versus vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colouring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points and simple regions in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points on a line with respect to a set of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Meta-theorems for Restrictions of Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.11.029 / rank
 
Normal rank

Latest revision as of 18:56, 9 December 2024

scientific article
Language Label Description Also known as
English
Complexity of conflict-free colorings of graphs
scientific article

    Statements

    Complexity of conflict-free colorings of graphs (English)
    0 references
    0 references
    0 references
    6 January 2015
    0 references
    conflict-free coloring
    0 references
    NP-completeness
    0 references
    parametrized algorithm
    0 references

    Identifiers

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