Conflict-free connections of graphs (Q1656907)

From MaRDI portal
Revision as of 08:20, 16 July 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
Conflict-free connections of graphs
scientific article

    Statements

    title
    Conflict-free connections of graphs (English)
    0 references
    DOI
    10.7151/dmgt.2036
    0 references
    author
    Július Czap
    0 references
    Juraj Valiska
    0 references
    Stanlislav Jendroľ
    0 references
    publication date
    10 August 2018
    0 references
    zbMATH DE Number
    6916578
    0 references
    zbMATH Keywords
    edge-coloring
    0 references
    conflict-free connection
    0 references
    2-edge-connected graph
    0 references
    tree
    0 references
    OpenAlex ID
    W2794264135
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1656907&oldid=36415362"
    Powered by MediaWiki