The complexity of restricted star colouring (Q2161257): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2021.05.015 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ColPack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3168876418 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2108.02979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph 2-rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation / 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: Q5180766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: ColPack / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex rankings of graphs and its relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical algorithms for MSO model-checking on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of an outerplanar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic and star colorings of cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard tiling problems with simple tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of restricted variant of star colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of graphs with girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2021.05.015 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:27, 17 December 2024

scientific article
Language Label Description Also known as
English
The complexity of restricted star colouring
scientific article

    Statements

    The complexity of restricted star colouring (English)
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    graph colouring
    0 references
    star colouring
    0 references
    restricted star colouring
    0 references
    unique superior colouring
    0 references
    vertex ranking
    0 references
    complexity
    0 references

    Identifiers

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