Single‐conflict colouring-Reference-Cited by-同舟云学术

Single‐conflict colouring

Published:2020-11-04 Issue:1 Volume:97 Page:148-160
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J Graph Theory

Author:

Dvořák Zdeněk¹^ORCID,Esperet Louis²^ORCID,Kang Ross J.³^ORCID,Ozeki Kenta⁴^ORCID

Affiliation:

1. Computer Science Institute (CSI) Charles University Prague Czech Republic

2. CNRS, G‐SCOP Université Grenoble Alpes Grenoble France

3. Department of Mathematics Radboud University Nijmegen The Netherlands

4. Faculty of Environment and Information Sciences Yokohama National University Yokohama Japan

Funder

EP-Nuffic

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Agence Nationale de la Recherche

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

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

Reference18 articles.

1. Colorings and orientations of graphs

2. The asymptotic behavior of the correspondence chromatic number

3. The Local Cut Lemma

4. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

5. P.Erdős A. L.Rubin andH.Taylor Choosability in graphs Proceedings of the West Coast Conference on Combinatorics Graph Theory and Computing (Humboldt State Univ. Arcata CA 1979) Congress. No. XXVI Utilitas Math. 1980 pp. 125–157.

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

1. Minimal abundant packings and choosability with separation;Designs, Codes and Cryptography;2024-09-03

2. Constructing Graphs with No Independent Transversals;The Electronic Journal of Combinatorics;2024-05-31

3. Degree criteria and stability for independent transversals;Journal of Graph Theory;2024-02-14

4. List 4-colouring of planar graphs;Journal of Combinatorial Theory, Series B;2023-09

5. Single‐conflict colorings of degenerate graphs;Journal of Graph Theory;2023-08-17