On conflict-free connection of graphs (Q1727736)

From MaRDI portal
Revision as of 09:09, 18 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
On conflict-free connection of graphs
scientific article

    Statements

    title
    On conflict-free connection of graphs (English)
    0 references
    author
    Hong Chang
    0 references
    Zhong Huang
    0 references
    Yaping Mao
    0 references
    Xue Liang Li
    0 references
    Hai-xing Zhao
    0 references
    publication date
    20 February 2019
    0 references
    zbMATH DE Number
    7027134
    0 references
    zbMATH Keywords
    edge-coloring
    0 references
    connectivity
    0 references
    conflict-free connection number
    0 references
    Nordhaus-Gaddum-type result
    0 references
    OpenAlex ID
    W2891323680
    0 references
    cites work
    Q5422499
    0 references
    Q5692720
    0 references
    Q3377651
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1727736&oldid=36474406"
    Powered by MediaWiki