List coloring digraphs-Reference-Cited by-同舟云学术

List coloring digraphs

Published:2017-06-27 Issue:4 Volume:87 Page:492-508
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Bensmail Julien¹,Harutyunyan Ararat²,Le Ngoc Khang³

Affiliation:

1. Université Côte d'Azur; CNRS, I3S Inria France

2. Institut de Mathématiques de Toulouse; Université Toulouse III; 31062 Toulouse Cedex 09 France

3. Laboratoire d'Informatique du Parallélisme; École Normale Supérieure de Lyon; 69364 Lyon Cedex 07 France

Funder

European Research Council

Centre International de Mathématiques et Informatique de Toulouse

Fonds de Recherche Nature et Technologies

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference23 articles.

1. The choice number of random bipartite graphs;Alon;Ann. Comb.,1998

2. List coloring of random and pseudo-random graphs;Alon;Combinatorica,1999

3. The Probabilistic Method

4. The circular chromatic number of a digraph;Bokal;J. Graph Theory,2004

5. Problems and results in number theory and graphs theory;Erdős;Proceedings of the 9th Manitoba Conference on Numerical Mathematics and Computing,1979

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

1. Coloring k-partite sparse digraphs;Discrete Applied Mathematics;2024-08

2. Majority Colorings of Some Special Digraphs;Proceedings of the 2023 8th International Conference on Mathematics and Artificial Intelligence;2023-04-07

3. Colouring complete multipartite and Kneser-type digraphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

4. Digraph Coloring and Distance to Acyclicity;Theory of Computing Systems;2022-12-07

5. Decomposing and colouring some locally semicomplete digraphs;European Journal of Combinatorics;2022-12