Uniquely Colourable Graphs with Large Girth
Work
Year: 1976
Type: article
Abstract: Tutte [ 1 ], writing under a pseudonym, was the first to prove that a graph with a large chromatic number need not contain a triangle. The result was rediscovered by Zykov [ 5 ] and Mycielski [ 4 ]. E... more
Source: Canadian Journal of Mathematics
Authors Béla Bollobás, Norbert Sauer
Institutions University of Cambridge, University of Calgary
Cites: 1
Cited by: 39
Related to: 10
FWCI:
Citation percentile (by year/subfield): 89.4
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze