On coloring problems with local constraints (Q5891606): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q831860
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2012.03.019 / rank
Normal rank
 
Property / author
 
Property / author: Flavia Bonomo-Braberman / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.03.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2176348781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the complexity boundary between coloring and list-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and linear time recognition of 3-leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Real-World Train Unit Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring Extension III: Classes of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for the optimum cost chromatic partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized coloring for tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension on unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal greedy heuristic to color interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2012.03.019 / rank
 
Normal rank

Latest revision as of 17:17, 9 December 2024

scientific article; zbMATH DE number 6047037
Language Label Description Also known as
English
On coloring problems with local constraints
scientific article; zbMATH DE number 6047037

    Statements

    On coloring problems with local constraints (English)
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    graph coloring
    0 references
    clique-trees
    0 references
    unit interval graphs
    0 references
    computational complexity
    0 references

    Identifiers