Conflict-free connection numbers of line graphs

DOI10.1007/978-3-319-71150-8_14zbMath1470.05137arXiv1705.05317OpenAlexW2616264412MaRDI QIDQ1699775

Bo Deng, Yaping Mao, Wen-Jing Li, Hai-xing Zhao, Xue Liang Li

Publication date: 26 February 2018

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

zbMATH Keywords

claw-free graphsline graphs\(K\)-iterated line graphsconflict-free connection number

Mathematics Subject Classification ID

Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (12)

Conflict-free connection number of graphs with four bridges ⋮ Conflict-free connection number of random graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ On conflict-free connection 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 ⋮ Conflict-free connection number and size of graphs ⋮ Conflict-free connection of trees ⋮ Some results on strong conflict-free connection number of graphs

This page was built for publication: Conflict-free connection numbers of line graphs