Conflict-free (vertex)-connection numbers of graphs with small diameters

zbMath1439.05089arXiv1902.10881MaRDI QIDQ5109070

Xiaoyu Zhu, Xue Liang Li

Publication date: 7 May 2020

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

zbMATH Keywords

conflict-free connection coloringconflict-free vertex-connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Connectivity (05C40)

Related Items (2)

Conflict-free connection number of graphs with four bridges ⋮ On the \(k\)-component independence number of a tree

Cites Work

• Unnamed Item
• 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
• 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
• Strong conflict-free connection of graphs
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Erd\"os-Gallai-type results for conflict-free connection of graphs

This page was built for publication: Conflict-free (vertex)-connection numbers of graphs with small diameters