Clique and chromatic number of circular-perfect graphs (Q2883567): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284584 / 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: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rank-perfect subclasses of near-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular perfect graphs / rank
 
Normal rank

Latest revision as of 04:24, 5 July 2024

scientific article
Language Label Description Also known as
English
Clique and chromatic number of circular-perfect graphs
scientific article

    Statements

    Identifiers