We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to t(n) = 2/3 + 1/3 (3)root (26 + 6 root (33)) + 1/3 (3)root (26 - 6 root (33)) = 1.29559.... then the graph has no hamiltonian path. This result is best possible in the sense that ii becomes false if t(0) is replaced by any larger number. (C) 2000 Academic Press.
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil
Bueno, Leticia R.
Faria, Luerbio
论文数: 0引用数: 0
h-index: 0
机构:
Univ Estado Rio de Janeiro, Fac Formacao Professores, Dept Matemat, BR-24435000 Sao Goncalo, RJ, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil
Faria, Luerbio
de Figueiredo, Celina M. H.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil
de Figueiredo, Celina M. H.
da Fonseca, Guilherme D.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, BrazilUniv Fed Rio de Janeiro, Programa Engn Sistemas & Computacao COPPE, BR-21941972 Rio De Janeiro, Brazil