On the tractability of \(( k , i )\)-coloring (Q2235289): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4568175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized k-tuple colorings of cycles and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of a family of graph-colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tractability of \((k,i)\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n\)-tuple coloring of planar graphs with large odd girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for Graphs of Bounded Feedback Vertex Set Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Parameterized Algorithms for (k, i)-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on<i>n</i>-tuple colourings and circular colourings of planar graphs with large odd girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: n-tuple colorings and associated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Treewidth and Related Problems / rank
 
Normal rank

Latest revision as of 21:40, 26 July 2024

scientific article
Language Label Description Also known as
English
On the tractability of \(( k , i )\)-coloring
scientific article

    Statements

    On the tractability of \(( k , i )\)-coloring (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2021
    0 references
    graph coloring
    0 references
    parameterized algorithms
    0 references
    NP-completeness
    0 references

    Identifiers