On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514): 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: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free strongly circular-perfect 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: Minimal circular-imperfect graphs of large clique number and large independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three classes of minimal circular-imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the circular chromatic number of circular partitionable graphs / 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: Some results on circular perfect graphs and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular perfect graphs / rank
 
Normal rank

Latest revision as of 16:18, 6 July 2024

scientific article
Language Label Description Also known as
English
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
scientific article

    Statements

    On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (English)
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    0 references
    circular-perfect graph
    0 references
    polytope
    0 references
    circular-clique number
    0 references
    circular-chromatic number
    0 references
    polynomial time computability
    0 references
    0 references