Asymptotically optimal frugal colouring
Authors:
- 1 March 2010
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 100 (2) , 226-246
Abstract
No abstract availableKeywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada
This publication has 20 references indexed in Scilit:
- Concentration for Independent PermutationsCombinatorics, Probability and Computing, 2002
- Asymptotics of the list-chromatic index for multigraphsRandom Structures & Algorithms, 2000
- A Bound on the Total Chromatic NumberCombinatorica, 1998
- Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ ColorsSIAM Journal on Computing, 1998
- Colouring a graph frugallyCombinatorica, 1997
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- Lopsided Lovász Local Lemma and Latin transversalsDiscrete Applied Mathematics, 1991
- On a combinatorial gameJournal of Combinatorial Theory, Series A, 1973
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952