scientific article; zbMATH DE number 1303525
From MaRDI portal
Publication:4250147
zbMath0926.05018MaRDI QIDQ4250147
Bruce A. Reed, Michael S. O. Molloy
Publication date: 8 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Local boxicity ⋮ 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) ⋮ Bounded colorings of multipartite graphs and hypergraphs ⋮ Induced odd cycle packing number, independent sets, and chromatic number ⋮ Upper bounds on minimum balanced bipartitions ⋮ A Stronger Bound for the Strong Chromatic Index ⋮ Edge-colouring graphs with local list sizes ⋮ The adaptable choosability number grows with the choosability number ⋮ Circumference, chromatic number and online coloring ⋮ Randomly colouring graphs (a combinatorial view) ⋮ An upper bound for the chromatic number of line graphs ⋮ An estimate for the probability of dependent events ⋮ Asymptotically optimal frugal colouring ⋮ (\(\Delta-k\))-critical graphs ⋮ Near-optimal list colorings ⋮ Rainbow factors in hypergraphs ⋮ Asymptotically the list colouring constants are 1 ⋮ A strengthening of Brooks' theorem ⋮ Additive non-approximability of chromatic number in proper minor-closed classes ⋮ Distributed coloring algorithms for triangle-free graphs ⋮ The chromatic and clique numbers of random scaled sector graphs
This page was built for publication:
