Coloring triangle‐free graphs with local list sizes-Reference-Cited by-同舟云学术

Coloring triangle‐free graphs with local list sizes

Author:

Davies Ewan¹,Joannis de Verclos Rémi²,Kang Ross J.²,Pirot François²³

Affiliation:

1. Korteweg‐De Vries Institute for MathematicsUniversity of AmsterdamAmsterdam Netherlands

2. Department of MathematicsRadboud University NijmegenNijmegen Netherlands

3. LORIA, Université de LorraineNancy France

Funder

European Research Council under the European Union's Seventh Framework Programme

European Research Council Nederlandse Organisatie voor Wetenschappelijk Onderzoek ERC Grant

Vidi Grant of the Netherlands Organisation for Scientific Research

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

Reference17 articles.

3. Bipartite induced density in triangle‐free graphs;Cames van Batenburg W.;Electron. J. Combin.,2018

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

2. Edge-colouring graphs with local list sizes;Journal of Combinatorial Theory, Series B;2024-03

3. On the Hasse diagram of binary linear codes;Discrete Mathematics, Algorithms and Applications;2024-01-22

4. Counting colorings of triangle-free graphs;Journal of Combinatorial Theory, Series B;2023-07

5. The Power of Multi-step Vizing Chains;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02