Premium
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak‐Rödl function
Author(s) -
Tardif Claude,
Wehlau David
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20117
Subject(s) - chromatic scale , combinatorics , mathematics , bounded function , undirected graph , graph , discrete mathematics , function (biology) , mathematical analysis , evolutionary biology , biology
Let f ( n ) = min{χ( G × H ) : G and H are n ‐chromatic digraphs} and g ( n ) = min{χ( G × H ) : G and H are n ‐chromatic graphs}. We prove that f is bounded if and only if g is bounded. © 2005 Wiley Periodicals, Inc. J Graph Theory
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom