On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index (Q580363)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
scientific article

    Statements

    On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    A \(\Delta\)-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree \(\Delta =\Delta (G)\). We show that a non- empty simple graph H can be a \(\Delta\)-subgraph of a graph G, which is critical with respect to the chromatic index, if and only if H has not vertices of degree 0 or 1.
    0 references
    maximum degree
    0 references
    chromatic index
    0 references
    delta subgraph
    0 references
    induced subgraph
    0 references
    critical graph
    0 references

    Identifiers