Strong conflict-free connection of graphs (Q2284053)

From MaRDI portal
Revision as of 12:34, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Strong conflict-free connection of graphs
scientific article

    Statements

    Strong conflict-free connection of graphs (English)
    0 references
    0 references
    0 references
    14 January 2020
    0 references
    strong conflict-free connection coloring (number)
    0 references
    characterization
    0 references
    cubic graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references