Conflict-free connection of trees-Reference-Cited by-同舟云学术

Conflict-free connection of trees

Published:2018-11-21 Issue:3 Volume:42 Page:340-353
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Chang Hong,Ji Meng,Li Xueliang^ORCID,Zhang Jingshu

Funder

NSFC

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-018-0363-x.pdf

Reference28 articles.

1. Bar-Noy A, Cheilaris P, Smorodinsky S (2008) Deterministic conflict-free coloring for intervals: from offline to online. ACM Trans Algorithms 4:44:1–44:18

2. Bodlaender HL, Deogun JS, Jansen K, Kloks T, Kratsch D, Müller H, Tuza Z (1998) Rankings of graphs. SIAM J Discret Math 11(1):168–181

3. Bondy JA, Murty USR (2008) Graph theory, GTM 244. Springer, Berlin

4. Borowiecki P, Budajová K, Jendroll’ S, Krajč S (2011) Parity vertex colouring of graphs. Discuss Math Gr Theory 31:183–195

5. Chang H, Huang Z, Li X, Mao Y, Zhao H (2018) On conflict-free connection of graphs, Discrete Appl. Math. https://doi.org/10.1016/j.dam.2018.08.006

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The conflict-free connection number and the minimum degree-sum of graphs;Applied Mathematics and Computation;2024-12

2. A survey on conflict-free connection coloring of graphs;Discrete Applied Mathematics;2024-07

3. Conflict-Free Connection Number of Graphs with Four Bridges;Graphs and Combinatorics;2023-04-15

4. Conflict-free Connection Number and Independence Number of a Graph;Acta Mathematicae Applicatae Sinica, English Series;2021-04

5. Some results on strong conflict-free connection number of graphs;Discrete Mathematics, Algorithms and Applications;2021-01-09