On the asymmetric representatives formulation for the vertex coloring problem (Q2482105): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cliques, holes and the vertex coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the graph coloring polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 21:33, 27 June 2024

scientific article
Language Label Description Also known as
English
On the asymmetric representatives formulation for the vertex coloring problem
scientific article

    Statements

    On the asymmetric representatives formulation for the vertex coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic number
    0 references
    combinatorial problems
    0 references
    facets of polyhedra
    0 references
    graph coloring
    0 references
    0 references