Some results on strong conflict-free connection number of graphs

DOI10.1142/S179383092150066XzbMath1479.05107OpenAlexW3107156132MaRDI QIDQ5025141

No author found.

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383092150066x

zbMATH Keywords

boundsouterplanarproduct graphstrong conflict-free connection number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Conflict-free connections of graphs
• Conflict-free connection numbers of line graphs
• On conflict-free connection of graphs
• Graphs with conflict-free connection number two
• Conflict-free connection of trees
• (Strong) conflict-free connectivity: algorithm and complexity
• Strong conflict-free connection of graphs
• Conflict-free coloring of points and simple regions in the plane
• Rainbow connection in graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Conflict-Free Coloring and its Applications

This page was built for publication: Some results on strong conflict-free connection number of graphs