The strong clique index of a graph with forbidden cycles-Reference-Cited by-同舟云学术

The strong clique index of a graph with forbidden cycles

Published:2021-06-06 Issue:2 Volume:98 Page:326-341
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J Graph Theory

Author:

Cho Eun‐Kyung¹^ORCID,Choi Ilkyoo¹^ORCID,Kim Ringi²^ORCID,Park Boram³^ORCID

Affiliation:

1. Department of Mathematics Hankuk University of Foreign Studies Yongin‐si Gyeonggi‐do Republic of Korea

2. Department of Mathematics Inha University Incheon Republic of Korea

3. Department of Mathematics Ajou University Suwon‐si Gyeonggi‐do Republic of Korea

Funder

Inha University

Hankuk University of Foreign Studies

National Research Foundation of Korea

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22700

Reference20 articles.

1. L. D.Andersen The strong chromatic index of a cubic graph is at most 10 Discrete Math.108(1992) no. 1–3 231–252.

2. J.Bang‐Jensen B.Reed M.Schacht R.Šámal B.Toft andU.Wagner On six problems posed by Jarik Nešetřil. In: M. Klazar J. Kratochvíl M. Loebl J. Matoušek P. Valtr R. Thomas (eds) Topics in Discrete Mathematics Algorithms Combin. vol. 26 Springer Berlin 2006 pp. 613–627.

3. M.Bonamy T.Perrett andL.Postle Colouring graphs with sparse neighbourhoods: bounds and applications arXiv e‐prints page arXiv:1810.06704 October 2018.

4. A Stronger Bound for the Strong Chromatic Index

5. W.Cames van Batenburg Cliques colours and clusters Ph.D. Thesis Radboud University 2018.

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

1. $t$-Strong Cliques and the Degree-Diameter Problem;SIAM Journal on Discrete Mathematics;2021-01