Publication:4250147
From MaRDI portal
zbMath0926.05018MaRDI QIDQ4250147
Bruce A. Reed, Michael S. O. Molloy
Publication date: 8 November 1999
Related Items
A Stronger Bound for the Strong Chromatic Index, Near-optimal list colorings, Induced odd cycle packing number, independent sets, and chromatic number, A lower bound on the independence number of a graph in terms of degrees and local clique sizes, A stronger bound for the strong chromatic index (extended abstract), Upper bounds on minimum balanced bipartitions, Randomly colouring graphs (a combinatorial view), The adaptable choosability number grows with the choosability number, The chromatic and clique numbers of random scaled sector graphs, An estimate for the probability of dependent events, Asymptotically optimal frugal colouring, A strengthening of Brooks' theorem, (\(\Delta-k\))-critical graphs, Asymptotically the list colouring constants are 1, Additive non-approximability of chromatic number in proper minor-closed classes, Local boxicity, Rainbow factors in hypergraphs, Distributed coloring algorithms for triangle-free graphs, Bounded colorings of multipartite graphs and hypergraphs, Circumference, chromatic number and online coloring, An upper bound for the chromatic number of line graphs