Some extremal results on the colorful monochromatic vertex-connectivity of a graph-Reference-Cited by-同舟云学术

Some extremal results on the colorful monochromatic vertex-connectivity of a graph

Published:2018-02-28 Issue:4 Volume:35 Page:1300-1311
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Cai Qingqiong,Li Xueliang,Wu Di

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

http://link.springer.com/article/10.1007/s10878-018-0258-x/fulltext.html

Reference23 articles.

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

2. Cai Q, Li X, Wu D (2017) Erdős–Gallai-type results for colorful monochromatic connectivity of a graph. J Comb Optim 33(1):123–131

3. Caro Y, West DB, Yuster R (2000) Connected domination and spanning trees with many leaves. SIAM J Discrete Math 13(2):202–211

4. Caro Y, Yuster R (2011) Colorful monochromatic connectivity. Discrete Math 311:1786–1792

5. Chen L, Li X, Liu M (2011) Nordhaus–Gaddum-type bounds for rainbow vertex-connection number of a graph. Utilitas Math 86:335–340

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

1. On \mathcal P vertex-connections of graphs;Discussiones Mathematicae Graph Theory;2024

2. Results on monochromatic vertex disconnection of graphs;AIMS Mathematics;2023

3. Rainbow and Monochromatic Vertex-connection of Random Graphs;Acta Mathematicae Applicatae Sinica, English Series;2022-10

4. Fractional matching preclusion number of graphs;Discrete Applied Mathematics;2022-04

5. Further results on the total monochromatic connectivity of graphs;Journal of Combinatorial Optimization;2022-02-23