Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642040153, 9783642040160

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Hadwiger’s Conjecture

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_6 ◽

2002 ◽

pp. 49-53

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Hadwiger's Conjecture ◽

Hadwiger’S Conjecture

Hard-Core Distributions on Matchings

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_22 ◽

2002 ◽

pp. 247-264

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Hard Core

Probabilistic Preliminaries

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_2 ◽

2002 ◽

pp. 15-24

Author(s):

Michael Molloy ◽

Bruce Reed

The Asymptotics of Edge Colouring Multigraphs

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_23 ◽

2002 ◽

pp. 265-283

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Edge Colouring

A Closer Look at Talagrand’s Inequality

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_20 ◽

2002 ◽

pp. 231-236

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Talagrand’S Inequality

Graphs with Girth at Least Five

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_12 ◽

2002 ◽

pp. 107-124

Author(s):

Michael Molloy ◽

Bruce Reed

Azuma’s Inequality and a Strengthening of Brooks’ Theorem

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_11 ◽

2002 ◽

pp. 91-103

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Azuma's Inequality

The Strong Chromatic Number

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_8 ◽

2002 ◽

pp. 61-65

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Chromatic Number ◽

Strong Chromatic Number

The Chernoff Bound

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_5 ◽

2002 ◽

pp. 43-46

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Chernoff Bound

Near Optimal Total Colouring I: Sparse Graphs

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method ◽

10.1007/978-3-642-04016-0_17 ◽

2002 ◽

pp. 185-193

Author(s):

Michael Molloy ◽

Bruce Reed

Keyword(s):

Sparse Graphs

Algorithms and Combinatorics - Graph Colouring and the Probabilistic MethodLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Hadwiger’s Conjecture

Hard-Core Distributions on Matchings

Probabilistic Preliminaries

The Asymptotics of Edge Colouring Multigraphs

A Closer Look at Talagrand’s Inequality

Graphs with Girth at Least Five

Azuma’s Inequality and a Strengthening of Brooks’ Theorem

The Strong Chromatic Number

The Chernoff Bound

Near Optimal Total Colouring I: Sparse Graphs

Algorithms and Combinatorics - Graph Colouring and the Probabilistic Method
Latest Publications