Conflict-free connections of graphs

DOI10.7151/dmgt.2036zbMath1392.05039OpenAlexW2794264135MaRDI QIDQ1656907

Július Czap, Juraj Valiska, Stanlislav Jendroľ

Publication date: 10 August 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2036

zbMATH Keywords

treeedge-coloring2-edge-connected graphconflict-free connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items

Maximum value of conflict-free vertex-connection number of graphs, Conflict-free connection number of graphs with four bridges, The conflict-free vertex-connection number and degree conditions of graphs, Conflict-free connection number of random graphs, Loose edge-connection of graphs, Hardness results for three kinds of colored connections of graphs, On conflict-free connection of graphs, Conflict-free vertex connection number at most 3 and size of graphs, Graphs with conflict-free connection number two, Conflict-free (vertex)-connection numbers of graphs with small diameters, Conflict-free connection number and independence number of a graph, Conflict-free vertex-connections of graphs, (Strong) conflict-free connectivity: algorithm and complexity, Odd connection and odd vertex-connection of graphs, From colourful to rainbow paths in graphs: colouring the vertices, Conflict-free connection number and size of graphs, Conflict-free connection of trees, Some results on strong conflict-free connection number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on rainbow connectivity
• Proper connection of graphs
• Graph unique-maximum and conflict-free colorings
• Proper connection number of random graphs
• Unique-maximum coloring of plane graphs
• Coloring graphs to produce properly colored walks
• Rainbow connections of graphs: a survey
• Proper connection and size of graphs
• On Minimum Edge Ranking Spanning Trees
• Rainbow connection number of dense graphs
• Rainbow connection in sparse graphs
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Conflict-Free Colourings of Graphs and Hypergraphs
• Rainbow Connection in Graphs with Minimum Degree Three
• Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs