On conflict-free connection of graphs (Q1727736)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On conflict-free connection of graphs
scientific article

    Statements

    On conflict-free connection of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    0 references
    edge-coloring
    0 references
    connectivity
    0 references
    conflict-free connection number
    0 references
    Nordhaus-Gaddum-type result
    0 references
    0 references
    0 references
    0 references
    0 references