On the size of identifying codes in triangle-free graphs-Reference-Cited by-同舟云学术

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

On the size of identifying codes in triangle-free graphs

Published:2012-07 Issue:10-11 Volume:160 Page:1532-1546
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Foucaud Florent,Klasing Ralf,Kosowski Adrian,Raspaud André

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference33 articles.

1. Minimal identifying codes in trees and planar graphs with large girth;Auger;European Journal of Combinatorics,2010

2. Complexity results for identifying codes in planar graphs;Auger;International Transactions in Operational Research,2010

3. Identifying and locating-dominating codes on chains and cycles;Bertrand;European Journal of Combinatorics,2004

4. 1-identifying codes on trees;Bertrand;Australasian Journal of Combinatorics,2005

5. Parity graphs;Burley;Annals of Discrete Mathematics,1982

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

1. Identifying codes in bipartite graphs of given maximum degree;Procedia Computer Science;2023

2. THE IDENTIFYING CODE NUMBER AND MYCIELSKI'S CONSTRUCTION OF GRAPHS;TRANS COMB;2022

3. Strong identification codes for graphs;Discrete Mathematics;2021-09

4. Improved Upper Bounds for Identifying Codes in n-dimensional q-ary Cubes;International Journal of Applied and Computational Mathematics;2020-03-07

5. Identifying codes in the direct product of a path and a complete graph;Discussiones Mathematicae Graph Theory;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP