Welsh-Powell opposition graphs (Q1115450): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90107-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012304296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four classes of perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the semi-perfect elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: All variations on perfectly orderable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank

Latest revision as of 12:57, 19 June 2024

scientific article
Language Label Description Also known as
English
Welsh-Powell opposition graphs
scientific article

    Statements

    Welsh-Powell opposition graphs (English)
    0 references
    0 references
    1989
    0 references
    We characterize a class of graphs for which the Welsh-Powell colouring heuristics results in an optimum colouring. We outline a polynomial-time recognition algorithm together with linear-time optimization algorithms for this class of graphs.
    0 references
    Welsh-Powell colouring heuristics
    0 references
    optimum colouring
    0 references
    recognition algorithm
    0 references

    Identifiers