Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Total Colouring of Hypergraphs

Peter Cowling1
1 Université Libre de Bruxelles Service de Mathématiques de la Gestion CP 210/01 Boulevard du Triomphe 1050 Bruxelles Belgium
  • Published: 31/10/1995

Abstract

We provide two new upper bounds on the total chromatic number of all hypergraphs and give two conjectures related to both the Total Colouring Conjecture for graphs and the Erdős-Faber-Lovász Conjecture.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Peter Cowling. Total Colouring of Hypergraphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 019. 151-160. DOI: .