Strong conflict-free connection of graphs

DOI10.1016/j.amc.2019.124639zbMath1433.05120arXiv1901.08240OpenAlexW2970205223WikidataQ127310719 ScholiaQ127310719MaRDI QIDQ2284053

Meng Ji, Xue Liang Li

Publication date: 14 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.08240

zbMATH Keywords

characterizationcubic graphstrong conflict-free connection coloring (number)

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (2)

Conflict-free (vertex)-connection numbers of graphs with small diameters ⋮ Some results on strong conflict-free connection number of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Rainbow disconnection in graphs
• On conflict-free connection of graphs
• Conflict-free connection of trees
• Conflict-free vertex connection number at most 3 and size of graphs
• Conflict-free vertex-connections of graphs
• (Strong) conflict-free connectivity: algorithm and complexity
• On strong proper connection number of cubic graphs
• Rainbow connection in graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

This page was built for publication: Strong conflict-free connection of graphs