Characterizing and edge-colouring split-indifference graphs (Q1383379): 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: The Colour Numbers of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-chromatic number of a graph / 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: On edge-colouring indifference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs which are vertex-critical with respect to the edge-chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloring the incidentors of a weighted directed multigraph / rank
 
Normal rank

Revision as of 12:02, 28 May 2024

scientific article
Language Label Description Also known as
English
Characterizing and edge-colouring split-indifference graphs
scientific article

    Statements

    Characterizing and edge-colouring split-indifference graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 June 1998
    0 references
    0 references
    algorithms
    0 references
    split graphs
    0 references
    characterization
    0 references
    edge colouring
    0 references
    perfect matching
    0 references
    chromatic index
    0 references
    indifference graphs
    0 references