On the chromatic index of path decompositions (Q1876679)

From MaRDI portal
Revision as of 19:25, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the chromatic index of path decompositions
scientific article

    Statements

    On the chromatic index of path decompositions (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2004
    0 references
    Given a decomposition \(D\) of a graph \(H\) into edge-disjoint copies of a graph \(G\), the chromatic index of \(D\) is the minimum number of colours in any colouring of the copies of \(G\) in \(D\) in which no two copies of \(G\) having a vertex in common get the same colour. For given \(H\) and \(G\), the minimum chromatic index problem asks for the smallest chromatic index over all decompositions \(D\) of \(H\) into copies of \(G\). The authors solve this problem for the cases when \(H\) is the complete graph on \(n\) vertices, and \(G\) is the path with two and three edges, respectively.
    0 references
    Graph colourings
    0 references
    Graph decompositions
    0 references
    Chromatic index
    0 references
    Path designs
    0 references
    Graph designs
    0 references

    Identifiers