Fractionally total colouring Gn,p

Authors:
Conor Meagher;Bruce Reed
Affiliations:
School of Computer Science, McGill University, Montreal, Canada;Canada Research Chair in Graph Theory, School of Computer Science, McGill University, Montreal, Canada
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 6
Cited 0

Graphical evolution: an introduction to the theory of random graphs

Graphical evolution: an introduction to the theory of random graphs
A total-chromatic number analogue of Plantholt's theorem

Discrete Mathematics
On total colourings of graphs

Journal of Combinatorial Theory Series B
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Introduction to Linear Optimization

Introduction to Linear Optimization

Quantified Score

Hi-index	0.05

Visualization

Abstract

We study the fractional total chromatic number of G"n","p as p varies from 0 to 1. We also present an algorithm that computes the fractional total chromatic number of a random graph in polynomial expected time.