A survey on conflict-free connection coloring of graphs (Q6497946): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Online Conflict-Free Colouring for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic conflict-free coloring for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of derived graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on proper conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful monochromatic connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with conflict-free connection number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conflict-free connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conflict-free coloring for intervals / 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: Online Conflict‐Free Coloring for Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection numbers of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conflict-free vertex-connection number and degree conditions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection number and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free vertex connection number at most 3 and size of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Colouring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points and simple regions in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for three kinds of colored connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erd\"os-Gallai-type results for conflict-free connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conflict-free connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Strong) conflict-free connectivity: algorithm and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connection number and independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free coloring of points on a line with respect to a set of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum value of conflict-free vertex-connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free vertex-connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free (vertex)-connection numbers of graphs with small diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / 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: Q5692720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-Free Coloring and its Applications / rank
 
Normal rank

Latest revision as of 14:25, 3 December 2024

scientific article; zbMATH DE number 7843506
Language Label Description Also known as
English
A survey on conflict-free connection coloring of graphs
scientific article; zbMATH DE number 7843506

    Statements

    A survey on conflict-free connection coloring of graphs (English)
    0 references
    0 references
    0 references
    6 May 2024
    0 references
    conflict-free path
    0 references
    conflict-free connection number
    0 references
    strong conflict-free connection number
    0 references
    conflict-free vertex-connection number
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references