Decompositions for the edge colouring of reduced indifference graphs. (Q1401296): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of edge-colouring some restricted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for proper interval graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge-colouring indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total-chromatic number and chromatic index of dually chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs of time graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two conjectures on edge-colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank

Latest revision as of 09:49, 6 June 2024

scientific article
Language Label Description Also known as
English
Decompositions for the edge colouring of reduced indifference graphs.
scientific article

    Statements

    Decompositions for the edge colouring of reduced indifference graphs. (English)
    0 references
    17 August 2003
    0 references
    0 references
    Algorithms
    0 references
    Graph algorithms
    0 references
    Indifference graphs
    0 references
    Edge colouring
    0 references