Conflict-free connections of graphs (Q1656907)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Conflict-free connections of graphs
scientific article

    Statements

    Conflict-free connections of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2018
    0 references
    0 references
    edge-coloring
    0 references
    conflict-free connection
    0 references
    2-edge-connected graph
    0 references
    tree
    0 references
    0 references