Conflict-free connections of graphs (Q1656907): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proper connection and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2829346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3451017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph unique-maximum and conflict-free colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique-maximum coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on rainbow connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with rainbow connection number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Edge Ranking Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs to produce properly colored walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colourings of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow Connection in Graphs with Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311854 / rank
 
Normal rank

Latest revision as of 07:20, 16 July 2024

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
    10 August 2018
    0 references
    edge-coloring
    0 references
    conflict-free connection
    0 references
    2-edge-connected graph
    0 references
    tree
    0 references

    Identifiers