Conflict-free connection numbers of line graphs
From MaRDI portal
Publication:1699775
DOI10.1007/978-3-319-71150-8_14zbMath1470.05137arXiv1705.05317MaRDI 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
Related Items
Some results on strong conflict-free connection number of graphs, Conflict-free (vertex)-connection numbers of graphs with small diameters, Conflict-free connection number of graphs with four bridges, On conflict-free connection of graphs, Graphs with conflict-free connection number two, Conflict-free connection number and independence number of a graph, Conflict-free connection number and size of graphs, Conflict-free connection of trees, Conflict-free connection number of random graphs, Hardness results for three kinds of colored connections of graphs, Conflict-free vertex-connections of graphs, (Strong) conflict-free connectivity: algorithm and complexity