Graph covers using \(t\)-colourable vertex sets. (Q1427470): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimax relations for the partial q-colorings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max relation for the partial q-colourings of a graph. II: Box perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coflow polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Timetabling Problem / rank
 
Normal rank

Latest revision as of 15:27, 6 June 2024

scientific article
Language Label Description Also known as
English
Graph covers using \(t\)-colourable vertex sets.
scientific article

    Statements

    Graph covers using \(t\)-colourable vertex sets. (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    Graph colouring
    0 references
    Perfect graphs
    0 references
    Box perfection
    0 references
    Frequency assignment
    0 references