Complexity of fall coloring for restricted graph classes (Q5918283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE / 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: On uniquely colorable planar graphs / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4504904 / 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: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks about disjoint dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4559893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph fall-coloring: existence and constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fall colouring of bipartite graphs and Cartesian products of graphs / 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: On the NP-completeness of the \(k\)-colorability problem for triangle-free 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: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Revision as of 22:45, 25 July 2024

scientific article; zbMATH DE number 7357719
Language Label Description Also known as
English
Complexity of fall coloring for restricted graph classes
scientific article; zbMATH DE number 7357719

    Statements

    Complexity of fall coloring for restricted graph classes (English)
    0 references
    0 references
    0 references
    11 June 2021
    0 references
    graph theory
    0 references
    computational complexity
    0 references
    independent domination
    0 references
    fall coloring
    0 references

    Identifiers

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