Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum-Reference-Cited by-同舟云学术

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

Published:2004-05 Issue:1-3 Volume:141 Page:93-101
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Dantas Simone,Gravier Sylvain,Maffray Frédéric

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference12 articles.

1. Graphs with no induced C4 and 2K2;Blázsik;Discrete Math.,1993

2. Choosability in graphs;Erdős;Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, Congr. Numer.,1979

3. H.J. Finck, On the chromatic number of a graph and its complements, Theory of Graphs, Proceedings of the Colloquium, Tihany, Hungary, 1966, pp. 99–113.

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. S. Gravier, Coloration et produits de graphes, Doctoral Thesis, Université Joseph Fourier, Grenoble, France, 1996.

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

1. Extremal decompositions for Nordhaus-Gaddum theorems;Discrete Mathematics;2023-07

2. On Nordhaus–Gaddum type inequalities for the game chromatic and game coloring numbers;Discrete Mathematics;2019-05

3. On conflict-free connection of graphs;Discrete Applied Mathematics;2019-02

4. A survey of Nordhaus–Gaddum type relations;Discrete Applied Mathematics;2013-03

5. Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers;Discrete Mathematics;2009-04