Restricted coloring problems on graphs with few (Q2840684): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Nícolas A. Martins / rank
Normal rank
 
Property / author
 
Property / author: Rudini Menezes Sampaio / rank
Normal rank
 
Property / author
 
Property / author: Nícolas A. Martins / rank
 
Normal rank
Property / author
 
Property / author: Rudini Menezes Sampaio / 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.endm.2011.05.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W72948258 / 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: Grundy number on -classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The harmonious coloring problem is NP-complete for interval and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of graphs with few \(P_4\)s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for graphs with few \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achromatic number is NP-complete for cographs and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659607 / rank
 
Normal rank

Latest revision as of 16:26, 6 July 2024

scientific article
Language Label Description Also known as
English
Restricted coloring problems on graphs with few
scientific article

    Statements

    Restricted coloring problems on graphs with few (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 July 2013
    0 references
    0 references
    acyclic chromatic number
    0 references
    star chromatic number
    0 references
    harmonious chromatic number
    0 references
    greedy colorings
    0 references
    \((q
    0 references
    q
    0 references
    4q
    0 references
    4)\)-graphs
    0 references
    \(P_{4}\)-tidy graphs
    0 references
    polynomial time algorithms
    0 references
    0 references