Author:
Haxell Penny,MacDonald Colter
Funder
Natural Sciences and Engineering Research Council of Canada
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. On an upper bound of a graph's chromatic number depending on the graph's degree and density;Borodin;J. Comb. Theory, Ser. B,1977
2. On colouring the nodes of a network;Brooks;Math. Proc. Camb. Philos. Soc.,1941
3. Embedding subgraphs and coloring graphs under extremal degree conditions;Catlin,1976
4. Another bound on the chromatic number of a graph;Catlin;Discrete Math.,1978
5. A local strengthening of Reed's ω,Δ,χ conjecture for quasi-line graphs;Chudnovsky;SIAM J. Discrete Math.,2013