P
Pavol Hell
Researcher at Simon Fraser University
Publications - 247
Citations - 8935
Pavol Hell is an academic researcher from Simon Fraser University. The author has contributed to research in topics: Chordal graph & Homomorphism. The author has an hindex of 43, co-authored 244 publications receiving 8446 citations. Previous affiliations of Pavol Hell include Université de Montréal & University of British Columbia.
Papers
More filters
Book
Graphs and homomorphisms
Pavol Hell,Jaroslav Nešetřil +1 more
TL;DR: This chapter discusses the structure of Composition, the partial order of Graphs and Homomorphisms, and testing for the Existence of Homomorphism.
Journal ArticleDOI
On the complexity of H -coloring
Pavol Hell,Jaroslav Nešetřil +1 more
TL;DR: The natural conjecture, formulated in several sources, asserts that the H-coloring problem is NP-complete for any non-bipartite graph H, and a proof of this conjecture is given.
Journal ArticleDOI
On the History of the Minimum Spanning Tree Problem
Ron Graham,Pavol Hell +1 more
TL;DR: There are several apparently independent sources and algorithmic solutions of the minimum spanning tree problem and their motivations, and they have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century.
Journal ArticleDOI
The core of a graph
Pavol Hell,Jaroslav Nešetřil +1 more
TL;DR: It is found that the core of a finite graph is unique (up to isomorphism) and is also its smallest retract, and some homomorphism properties of cores are investigated, concluding that it is NP-complete to decide whether a graph is its own core.
Journal ArticleDOI
List Homomorphisms and Circular Arc Graphs
TL;DR: It is shown that the list homomorphism problem is polynomial time solvable if the complement of H is a circular arc graph of clique covering number two, and is NP-complete otherwise.