Perfect graphs of arbitrarily large clique-chromatic number (Q896010): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2015.09.008 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1750559240 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1506.08628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-transversal sets of line graphs and complements of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the Maximal Cliques of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-coloring some classes of odd-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-colouring all two-element maximal antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grötzsch theorem for the hypergraph of maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2015.09.008 / rank
 
Normal rank

Latest revision as of 07:32, 10 December 2024

scientific article
Language Label Description Also known as
English
Perfect graphs of arbitrarily large clique-chromatic number
scientific article

    Statements

    Identifiers

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