Large classes of infinite k-cop-win graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Large classes of infinite k-cop-win graphs

Published:2010-12 Issue:4 Volume:65 Page:334-342
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Bonato Anthony,Hahn Geňa,Tardif Claude

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference22 articles.

1. A game of cops and robbers;Aigner;Discrete Appl Math,1984

2. Sweeping and searching in graphs: A brief survey;Alspach;Matematiche,2006

3. On bridged graphs and cop-win graphs;Anstee;J Combin Theory Ser B,1988

4. On the cop number of a graph;Berarducci;Adv Appl Math,1993

5. The cop density of a graph;Bonato;Contrib Discrete Math,2007

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

1. The Localization game on locally finite trees;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

2. Cops and Robbers ordinals of cop-win trees;Discrete Mathematics;2017-05

3. Pursuit evasion on infinite graphs;Theoretical Computer Science;2016-12

4. Conjectures on Cops and Robbers;Graph Theory;2016

5. Graph Searching and Related Problems;Handbook of Combinatorial Optimization;2013

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP