Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable colorings of bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Branching Algorithm for Cluster Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Type Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some colorful problems parameterized by treewidth / 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: Q3455032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural parameterizations for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5377224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data reduction for graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equitable Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716273 / rank
 
Normal rank

Revision as of 13:47, 1 August 2024

scientific article; zbMATH DE number 7704065
Language Label Description Also known as
English
Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
scientific article; zbMATH DE number 7704065

    Statements

    Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (English)
    0 references
    0 references
    28 June 2023
    0 references
    equitable coloring
    0 references
    parameterized complexity
    0 references
    FPT algorithm
    0 references
    polynomial kernel
    0 references
    cross-composition
    0 references

    Identifiers