On conflict-free connection of graphs (Q1727736): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2891323680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph and its complement with specified properties. I: Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Nordhaus-Gaddum type relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic conflict-free coloring for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: 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: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free connections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum / 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: Conflict-Free Colorings of Rectangles Ranges / 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: Conflict-free coloring of points and simple regions in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of a Graph and its Complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly Colored Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of 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: Maximum value of conflict-free vertex-connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-free vertex-connections of graphs / 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: A note on Nordhaus-Gaddum inequalities for domination. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377651 / rank
 
Normal rank

Latest revision as of 09:09, 18 July 2024

scientific article
Language Label Description Also known as
English
On conflict-free connection of graphs
scientific article

    Statements

    On conflict-free connection of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    0 references
    edge-coloring
    0 references
    connectivity
    0 references
    conflict-free connection number
    0 references
    Nordhaus-Gaddum-type result
    0 references
    0 references
    0 references
    0 references
    0 references