Author:
Gupta Uttam K.,Pradhan Dinabandhu
Funder
National Board for Higher Mathematics
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. On an upper bound of a graph’s chromatic number, depending on the graph’s degree and density;Borodin;J. Combin. Theory Ser. B,1977
2. On clique separators, nearly chordal graphs, and the maximum weight stable set problem;Brandstädt;Theoret. Comput. Sci.,2007
3. On colouring the nodes of a network;Brooks;Math. Proc. Camb. Phil. Soc.,1941
4. Embedding Subgraphs and Coloring Graphs under Extremal Degree Conditions;Catlin,1976
5. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006