Pavol Hell

Pavol Hell

Auto-generated profile, based on publicly available information

Pavol Hell

School of Computing Science Simon Fraser University

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 1999 in Combinatorica
Verified
Journal Article
Closed access
PDF file
TFTomas Feder
Tomas Feder
PHPavol Hell
Pavol Hell
JHJing Huang
Jing Huang

7 November 2002 in Journal of Graph Theory
Verified
Journal Article
Closed access
PDF file
TFTomas Feder
Tomas Feder
PHPavol Hell
Pavol Hell
JHJing Huang
Jing Huang

30 April 2004 in Journal of Graph Theory
Verified
Journal Article
Closed access
PDF file
PHPavol Hell
Pavol Hell
JHJing Huang
Jing Huang

1 April 1996 in Transactions of the American Mathematical Society
Verified
Journal Article
Open access
PDF file
PHP. Hell
P. Hell
JNJ. Nesetril
J. Nesetril
XZX. Zhu
X. Zhu
Let H H be a fixed digraph. We consider the H H -colouring problem, i.e., the problem of deciding which digraphs G G admit a homomorphism to H H . We are interested in a characterization in terms of the absence in G G of certain tree-like obstructions. Specifically, we say that H H has tree duality if, for all digraphs G G , G G is not homomorphic to H H if and only if there is an oriented tree which is homomorphic to G G but not to H H . We prove that if H H has tree duality then the H H -colouring problem is polynomial. We also generalize tree duality to bounded treewidth duality and prove a similar result. We relate these duality concepts to the notion of the X _ \underline X -property studied by Gutjahr, Welzl, and Woeginger. We then focus on the case when H H itself is an oriented tree. In fact, we are particularly interested in those trees that have exactly one vertex of degree three and all other vertices of degree one or two. Such trees are called triads. We have shown in a companion paper that there exist oriented triads H H for which the H H -colouring problem is N P NP -complete. We contrast these with several families of oriented triads H H which have tree duality, or bounded treewidth duality, and hence polynomial H H -colouring problems. If P ≠ N P P \neq NP , then no oriented triad H H with an N P NP -complete H H -colouring problem can have bounded treewidth duality; however no proof of this is known, for any oriented triad H H . We prove that none of the oriented triads H H with N P NP -complete H H -colouring problems given in the companion paper has tree duality.

14 November 2005 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
KCKathie Cameron
Kathie Cameron
PHPavol Hell
Pavol Hell

30 April 2012 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
TFTomás Feder
Tomás Feder
PHPavol Hell
Pavol Hell
JHJing Huang
Jing Huang
ARArash Rafiey
Arash Rafiey