Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...