Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981171583 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0911.4199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between chromatic number and dynamic chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the list dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic list coloring of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colorings of graph powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conditional colorability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2nd-order conditional 3-coloring of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Revision as of 19:09, 5 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
scientific article

    Statements

    Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (English)
    0 references
    26 October 2012
    0 references
    2-hued chromatic number
    0 references
    2-hued coloring
    0 references
    independence number
    0 references
    probabilistic method
    0 references
    0 references
    0 references

    Identifiers