scientific article; zbMATH DE number 1303525
From MaRDI portal
Publication:4250147
zbMATH Open0926.05018MaRDI QIDQ4250147FDOQ4250147
Authors: Michael Molloy, Bruce Reed 
Publication date: 8 November 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (26)
- An estimate for the probability of dependent events
- Asymptotically the list colouring constants are 1
- Additive non-approximability of chromatic number in proper minor-closed classes
- Bounded colorings of multipartite graphs and hypergraphs
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- An exact method for graph coloring
- Upper bounds on minimum balanced bipartitions
- Circumference, chromatic number and online coloring
- Local boxicity
- Graph colouring and the probabilistic method
- Near-optimal list colorings
- Randomly colouring graphs (a combinatorial view)
- A Stronger Bound for the Strong Chromatic Index
- The adaptable choosability number grows with the choosability number
- Induced odd cycle packing number, independent sets, and chromatic number
- A stronger bound for the strong chromatic index (extended abstract)
- Edge-colouring graphs with local list sizes
- Probabilistic methods in coloring and decomposition problems
- Rainbow factors in hypergraphs
- An upper bound for the chromatic number of line graphs
- A strengthening of Brooks' theorem
- (\(\Delta-k\))-critical graphs
- Asymptotically optimal frugal colouring
- Distributed coloring algorithms for triangle-free graphs
- Title not available (Why is that?)
- The chromatic and clique numbers of random scaled sector graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250147)
