Erd\"os-Gallai-type results for conflict-free connection of graphs

zbMath1499.05218arXiv1812.10701MaRDI QIDQ5033135

Meng Ji, Xue Liang Li

Publication date: 22 February 2022

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

zbMATH Keywords

conflict-free connection numberconflict-free connection coloringErdős-Gallai-type result

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

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

This page was built for publication: Erd\"os-Gallai-type results for conflict-free connection of graphs