The MathNet Korea
Information Center for Mathematical Science

국내수학자

Information Center for Mathematical Science

국외수학자

Pavol Hell
이름 Pavol Hell 영어이름 Pavol Hell
이메일 mailpavol@cs.sfu.ca 소속기관 Simon Fraser University
home Rigid undirected graphs with given number of vertices. Comment. Math. Univ. Carolinae (1968), Vol 9, Pages 51-69
home Broadcasting in one dimension. Discrete Appl. Math. (1988), Vol 21, Pages 101-111
home On restricted two-factors. SIAM J. Discrete Math. (1988), Vol 1, Pages 472-484
home Bandwidth versus bandsize. Ann. Discrete Math. (1989), Vol , Pages 117-129
home The existence problem for graph homomorphisms. Ann. Discrete Math. (1989), Vol , Pages 255-265
home Universality of directed graphs of a given height. Arch. Math. (Brno) (1989), Vol 25, Pages 47-54
home The effect of two cycles on the complexity of colourings by directed graphs. Discrete Appl. Math. (1990), Vol 26, Pages 1-23
home On the complexity of $H$-coloring. J. Combin. Theory Ser. B (1990), Vol 48, Pages 92-110
home A note on the star chromatic number. J. Graph Theory (1990), Vol 14, Pages 479-482
home A simple existence criterion for $(g
home Local tournaments and proper circular arc graphs. Lecture Notes in Comput. Sci. (1990), Vol , Pages 101-108
home Images of rigid digraphs. European J. Combin. (1991), Vol 12, Pages 33-42
home Broadcasting in bounded degree graphs. SIAM J. Discrete Math. (1992), Vol 5, Pages 10-24
home Sparse broadcast graphs. Discrete Appl. Math. (1992), Vol 36, Pages 97-130
home Achromatic numbers and graph operations. Discrete Math. (1992), Vol 108, Pages 297-305
home On the complexity of colouring by superdigraphs of bipartite graphs. Discrete Math. (1992), Vol 109, Pages 27-44
home The core of a graph. Discrete Math. (1992), Vol 109, Pages 117-126
home Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs. Discrete Appl. Math. (1993), Vol 41, Pages 75-79
home Universality of $A$-mote graphs. European J. Combin. (1993), Vol 14, Pages 23-27
home Algorithms for degree constrained graph factors of minimum deficiency. J. Algorithms (1993), Vol 14, Pages 115-138
home The complexity of colouring by semicomplete digraphs. SIAM J. Discrete Math. (1988), Vol 1, Pages 281-298
home Une minoration asymptotique des nombres de Schur généralisés et de certains nombres de Ramsey. C. R. Acad. Sci. Paris Sér. A-B (1970), Vol 270, Pages A1477-A147
home Graphs and $k$-societies. Canad. Math. Bull. (1970), Vol 13, Pages 375-381
home Every finite graph is a full subgraph of a rigid graph. J. Combinatorial Theory Ser. B (1971), Vol 11, Pages 284-286
home Graph decompositions, handcuffed prisoners and balanced $P$-designs. Discrete Math. (1972), Vol 2, Pages 229-252
home Full embeddings into some cateogries of graphs. Algebra Universalis (1972), Vol 2, Pages 129-141
home Groups and monoids of regular graphs (and of graphs with bounded degrees). Canad. J. Math. (1973), Vol 25, Pages 239-251
home Generalized Ramsey theory for graphs. V. The Ramsey number of a digraph. Bull. London Math. Soc. (1974), Vol 6, Pages 175-182
home On some strongly rigid families of graphs and the full embedding they induce. Algebra Universalis (1974), Vol 4, Pages 108-126
home Absolute planar retracts and the four color conjecture. J. Combinatorial Theory Ser. B (1974), Vol 17, Pages 5-10
home Absolute retracts in graphs. Lecture Notes in Math. (1974), Vol 406, Pages 291-301
home Corrections: "Generalized Ramsey theory for graphs. Bull. London Math. Soc. (1975), Vol 7, Pages 87-88
home Subdirect products of bipartite graphs. Colloq. Math. Soc. (1975), Vol , Pages 857-866
home Some results on the Oberwolfach problem (decomposition of complete graphs into isomorphic quadratic factors). Aequationes Math. (1975), Vol 12, Pages 1-5
home On some independence results in graph theory. Proceedings of the Conference on Algebraic Aspects of Combinatorics (1975), Vol , Pages 89-122
home On forbidden quotients and the achromatic number. Proceedings of the Fifth British Combinatorial Conference (1976), Vol , Pages 283-292
home On the density of sets containing no $k$-element arithmetic progression of a certain kind. J. London Math. Soc. (2) (1976), Vol 13, Pages 226-234
home Graph with given achromatic number. Discrete Math. (1976), Vol 16, Pages 195-207
home Graph retractions. Accad. Naz. (1976), Vol , Pages 263-268
home Homomorphisms of graphs and of their orientations. Monatsh. Math. (1978), Vol 85, Pages 39-48
home On the completeness of a generalized matching problem. Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (1978), Vol , Pages 240-245
home Partial joins and graphs with given group, order, and size. Congress. Numer. (1978), Vol , Pages 357-371
home Graphs with given neighborhoods. I. Colloq. Internat. CNRS (1978), Vol , Pages 219-223
home Cohomomorphisms of graphs and hypergraphs. Math. Nachr. (1979), Vol 87, Pages 53-61
home On the edge-sets of rigid and corigid graphs. Math. Nachr. (1979), Vol 87, Pages 63-69
home Collecting autographs: $n$-node graphs that have $n$-integer signatures. Ann. New York Acad. Sci. (1979), Vol , Pages 93-102
home An introduction to the category of graphs. Ann. New York Acad. Sci. (1979), Vol , Pages 120-136
home Graphs with forbidden homomorphic images. Ann. New York Acad. Sci. (1979), Vol , Pages 270-280
home An intermediate value theorem for graphs with given automorphism group. J. Graph Theory (1979), Vol 3, Pages 35-41
home Graphs and parallel comparison algorithms. Congr. Numer. (1980), Vol 29, Pages 497-509
home Parallel sorting with constant time for comparisons. SIAM J. Comput. (1981), Vol 10, Pages 465-472
home Scheduling, matching, and coloring. Colloq. Math. Soc. Janos Bolyai (1981), Vol , Pages 273-279
home On generalized matching problems. Inform. Process. Lett. (1981), Vol 12, Pages 33-35
home Sorting and merging in rounds. SIAM J. Algebraic Discrete Methods (1982), Vol 3, Pages 465-473
home Homomorphism interpolation and approximation. North-Holland Math. Stud. (1982), Vol , Pages 213-227
home Analogues of the Shannon capacity of a graph. North-Holland Math. Stud. (1982), Vol , Pages 155-168
home On the complexity of general graph factor problems. SIAM J. Comput. (1983), Vol 12, Pages 601-609
home Counterexamples to theorems of Menger type for the diameter. Discrete Math. (1983), Vol 44, Pages 217-220
home The complexity of finding generalized paths in tournaments. J. Algorithms (1983), Vol 4, Pages 303-309
home Packings by cliques and by finite families of graphs. Discrete Math. (1984), Vol 49, Pages 45-59
home Broadcasting in grid graphs with given neighborhood templates. Congr. Numer. (1984), Vol 41, Pages 295-298
home Matroids with weighted bases and Feynman integrals. North-Holland Math. Stud. (1984), Vol , Pages 165-175
home On the history of the minimum spanning tree problem. Ann. Hist. Comput. (1985), Vol 7, Pages 43-57
home Sorting and graphs. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. (1985), Vol , Pages 169-184
home Concerning the achromatic number of graphs. J. Combin. Theory Ser. B (1996), Vol 40, Pages 21-39
home Packings by complete bipartite graphs. SIAM J. Algebraic Discrete Methods (1986), Vol 7, Pages 199-209
home On sub-Ramsey numbers. Ars Combin. (1986), Vol 22, Pages 199-206
home Jump number and width. Order (1986), Vol 3, Pages 227-234
home A note on $f$-factors in directed and undirected multigraphs. Graphs Combin. (1986), Vol 2, Pages 61-66
home On the problem of bandsize. Graphs Combin. (1987), Vol 3, Pages 279-284
home Absolute retracts and varieties of reflexive graphs. Canad. J. Math. (1987), Vol 39, Pages 544-567
home On multiplicative graphs and the product conjecture. Combinatorica (1988), Vol 8, Pages 63-74
home Graph endpoint coloring and distributed processing. Networks (1993), Vol 23, Pages 93-98
home Largest planar graphs of diameter two and fixed maximum degree. Discrete Math. (1993), Vol 111, Pages 313-322
home Biography of Martin Farber Discrete Appl. Math. (1993), Vol 44, Pages 5-7
home Absolute reflexive retracts and absolute bipartite retracts. Discrete Appl. Math. (1993), Vol 44, Pages 9-20
home On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory (1993), Vol 17, Pages 647-655
home Homomorphisms to oriented cycles. Combinatorica (1993), Vol 13, Pages 421-433
home Multiplicativity of oriented cycles. J. Combin. Theory Ser. B (1994), Vol 60, Pages 239-253
home On chordal proper circular arc graphs. Discrete Math. (1994), Vol 128, Pages 395-398
home Independence ratios of graph powers. Discrete Math. (1994), Vol 127, Pages 213-220
home Packing problems in edge-colored graphs. Discrete Appl. Math. (1994), Vol 52, Pages 295-306
home Homomorphisms to oriented paths. Discrete Math. (1994), Vol 132, Pages 107-114
home Optimal recognition of local tournaments. Congr. Numer. (1994), Vol 100, Pages 141-146
home Hereditarily hard $H$-colouring problems. Discrete Math. (1995), Vol 138, Pages 75-92
home Equicovering matroids by distinct bases. European J. Combin. (1995), Vol 16, Pages 159-162
home The existence of homomorphisms to oriented cycles. SIAM J. Discrete Math. (1995), Vol 8, Pages 208-222
home On the ultimate independence ratio of a graph. European J. Combin. (1995), Vol 16, Pages 253-261
home Large planar graphs with given diameter and maximum degree. Discrete Appl. Math. (1995), Vol 61, Pages 133-153
home Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. J. Graph Theory (1995), Vol 20, Pages 361-374
home On homomorphisms to acyclic local tournaments. J. Graph Theory (1995), Vol 20, Pages 467-471
home Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc. (1996), Vol 348, Pages 1281-1297
home Linear-time representation algorithms for proper circular-arc graphs and proper interval graphs. SIAM J. Comput. (1996), Vol 25, Pages 390-403
home A linear algorithm for maximum weight cliques in proper circular arc graphs. SIAM J. Discrete Math. (1996), Vol 9, Pages 274-289
home Duality of graph homomorphisms. Bolyai Soc. Math. Stud. (1996), Vol , Pages 271-282
home Rounding in symmetric matrices and undirected graphs. Discrete Appl. Math. (1996), Vol 70, Pages 1-21
home Complexity of tree homomorphisms. Discrete Appl. Math. (1996), Vol 70, Pages 23-36
home Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament. Lecture Notes in Comput. Sci. (1996), Vol , Pages 67-73
home Two remarks on circular arc graphs. Graphs Combin. (1997), Vol 13, Pages 65-72
home The complexity of restricted graph homomorphisms. Discrete Math. (1997), Vol 167/168, Pages 145-154
home Colouring paths in directed symmetric trees with applications to WDM routing. Lecture Notes in Comput. Sci. (1997), Vol , Pages 505-515
home List homomorphisms to reflexive graphs. J. Combin. Theory Ser. B (1998), Vol 72, Pages 236-250
home On the complexity of coloring areflexive $h$-ary relations with given permutation group. Ars Combin. (1998), Vol 48, Pages 111-128
home Broadcasting in planar graphs. Australas. J. Combin. (1998), Vol 17, Pages 309-318
home Optimal wavelength-routed multicasting. Discrete Appl. Math. (1998), Vol 84, Pages 15-20
home Constructions of large planar networks with given degree and diameter. Networks (1998), Vol 32, Pages 275-281
home A fully dynamic algorithm for recognizing and representing proper interval graphs. Lecture Notes in Comput. Sci. (1999), Vol , Pages 527-539
home List homomorphisms and circular arc graphs. Combinatorica (1999), Vol 19, Pages 487-505
home Complexity of graph partition problems. Annual ACM Symposium on Theory of Computing (1999), Vol , Pages 464-472
home The circular chromatic number of series-parallel graphs. J. Graph Theory (2000), Vol 33, Pages 14-24
home The complexity of $H$-colouring of bounded degree graphs. Discrete Math. (2000), Vol 22, Pages 101-109
home Three-and-more set theorems. Comment. Math. Univ. Carolin. (2000), Vol 41, Pages 793-801
home On homomorphisms to edge-coloured cycles. Electron. Notes Discrete Math. (2000), Vol , Pages 4
home Graph packings. Electron. Notes Discrete Math. (2000), Vol , Pages 4
home On nice graphs. Discrete Math. (2001), Vol 234, Pages 39-51
home High-girth graphs avoiding a minor are nearly bipartite. J. Combin. Theory Ser. B (2001), Vol 83, Pages 1-14
home A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM J. Comput. (2001), Vol 31, Pages 289-305
home Coloring all directed paths in a symmetric tree, with an application to optical networks. J. Graph Theory (2001), Vol 38, Pages 183-196
home On generalized split graphs. Electron. Notes Discrete Math. (2001), Vol , Pages 4
home Antidirected Hamiltonian paths between specified vertices of a tournament. Discrete Appl. Math. (2002), Vol 117, Pages 87-98
home Homomorphisms to powers of digraphs. Discrete Math. (2002), Vol 244, Pages 31-41
home Partitioning chordal graphs into independent sets and cliques. TEMA Tend. Mat. Apl. Comput. (2002), Vol 3, Pages 147-155
home Spanning trees with bounded number of branch vertices. Lecture Notes in Comput. Sci. (2002), Vol , Pages 355-365
home Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory (2003), Vol 42, Pages 61-80
home List partitions. SIAM J. Discrete Math. (2003), Vol 16, Pages 449-478
home Broadcasting in generalized chordal rings. Networks (2003), Vol 42, Pages 123-134
home Packing paths in digraphs. J. Graph Theory (2003), Vol 44, Pages 81-94
home Algorithmic aspects of graph homomorphisms. London Math. Soc. Lecture Note Ser. (2003), Vol , Pages 239-276
home Acyclic homomorphisms and circular colorings of digraphs. SIAM J. Discrete Math. (2003), Vol 17, Pages 161-169
home Counting list homomorphisms for graphs with bounded degrees. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (2004), Vol , Pages 105-112
home Partitioning chordal graphs into independent sets and cliques. Discrete Appl. Math. (2004), Vol 141, Pages 185-194
home Interval bigraphs and circular arc graphs. J. Graph Theory (2004), Vol 46, Pages 313-327
home Polychromatic cliques. Discrete Math. (2004), Vol 285, Pages 319-322
home Spanning spiders and light-splitting switches. Discrete Math. (2004), Vol 285, Pages 83-95
home Graphs and homomorphisms. Oxford Lecture Ser. Math. Appl. (2004), Vol , Pages
home List partitions of chordal graphs. Lecture Notes in Comput. Sci. (2004), Vol , Pages 100-108
home Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs. SIAM J. Discrete Math. (2004/05), Vol 18, Pages 554-570
home A generalization of the theorem of Lekkerkerker and Boland. Discrete Math. (2005), Vol 299, Pages 113-119
home Packing $r$-cliques in weighted chordal graphs. Ann. Oper. Res. (2005), Vol 138, Pages 179-187
home List matrix partitions of chordal graphs. Theoret. Comput. Sci. (2005), Vol 349, Pages 52-66
home Two algorithms for general list matrix partitions. Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), Vol , Pages 870-876
home Independent packings in structured graphs. Math. Program. (2006), Vol 105, Pages 201-213
home Full constraint satisfaction problems. SIAM J. Comput. (2006), Vol 36, Pages 230-246
home The $k$-piece packing problem. J. Graph Theory (2006), Vol 52, Pages 267-293
home From graph colouring to constraint satisfaction: there and back again. Algorithms Combin. (2006), Vol , Pages 407-432
home Matrix partitions of perfect graphs. Discrete Math. (2006), Vol 306, Pages 2450-2460
home Digraph matrix partitions and trigraph homomorphisms. Discrete Appl. Math. (2006), Vol 154, Pages 2458-2469
home List homomorphisms of graphs with bounded degrees. Discrete Math. (2007), Vol 307, Pages 386-392
home The structure of bi-arc trees. Discrete Math. (2007), Vol 307, Pages 393-401
home Generalized colourings (matrix partitions) of cographs. Trends Math. (2007), Vol , Pages 149-167
home On the density of trigraph homomorphisms. Graphs Combin. (2007), Vol 23, Pages 275-281
home Matrix partitions with finitely many obstructions. Electron. Notes Discrete Math. (2007), Vol , Pages 371-378
home Matrix partitions with finitely many obstructions. Electron. J. Combin. (2007), Vol 14, Pages 17
home Brooks-type theorems for pair-list colorings and list homomorphisms. SIAM J. Discrete Math. (2008), Vol 22, Pages 1-14
home On realizations of point determining graphs, and obstructions to full homomorphisms. Discrete Math. (2008), Vol 308, Pages 1639-1652
home Oriented star packings. J. Combin. Theory Ser. B (2008), Vol 98, Pages 558-576
home A dichotomy for minimum cost graph homomorphisms. European J. Combin. (2008), Vol 29, Pages 900-911
home On the adaptable chromatic number of graphs. European J. Combin. (2008), Vol 29, Pages 912-921
home Near-unanimity functions and varieties of reflexive graphs. SIAM J. Discrete Math. (2008), Vol 22, Pages 938-960
home Polarity of chordal graphs. Discrete Appl. Math. (2008), Vol 156, Pages 2469-2479
home Minimum cost homomorphisms to reflexive digraphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 182-193
home On injective colourings of chordal graphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 520-530
home Generalized colourings and matrix partitions. Ramanujan Math. Soc. Lect. Notes Ser. (2008), Vol , Pages 141-148
home Extension problems with degree bounds. Discrete Appl. Math. (2009), Vol 157, Pages 1592-1599
home Linear-time certifying algorithms for near-graphical sequences. Discrete Math. (2009), Vol 309, Pages 5703-5713
home Adaptable chromatic number of graph products. Discrete Math. (2009), Vol 309, Pages 6153-6159
home Adjusted interval digraphs. Electron. Notes Discrete Math. (2009), Vol , Pages 83-91
home Cycle transversals in bounded degree graphs. Electron. Notes Discrete Math. (2009), Vol , Pages 189-195
home Retractions to pseudoforests. SIAM J. Discrete Math. (2010), Vol 24, Pages 101-112
home Messy broadcasting—decentralized broadcast schemes with limited knowledge. Discrete Appl. Math. (2011), Vol 159, Pages 322-327
home Dichotomy for tree-structured trigraph list homomorphism problems. Discrete Appl. Math. (2011), Vol 159, Pages 1217-1224
home Cycle transversals in bounded degree graphs. Discrete Math. Theor. Comput. Sci. (2011), Vol 13, Pages 45-66
home Blocking quadruple: a new obstruction to circular-arc graphs. SIAM J. Discrete Math. (2014), Vol 28, Pages 631–655
home On the complexity of the 3-kernel problem in some classes of digraphs. Discuss. Math. Graph Theory (2014), Vol 34, Pages 167–185
home Matrix partitions of split graphs. Discrete Appl. Math. (2014), Vol 166, Pages 91–96
home A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. Discrete Math. (2014), Vol 318, Pages 53–57
home Semilattice polymorphisms and chordal graphs. European J. Combin. (2014), Vol 36, Pages 694–706
home Graph partitions with prescribed patterns. European J. Combin. (2014), Vol 35, Pages 335–353
home Graphs admitting k -NU operations. Part 1: The reflexive case. SIAM J. Discrete Math. (2013), Vol 27, Pages 1940–1963
home Recognition and characterization of chronological interval digraphs. Electron. J. Combin. (2013), Vol 20, Pages Paper 5,
home Obstructions to partitions of chordal graphs. Discrete Math. (2013), Vol 313, Pages 1861–1871
home Approximation of minimum cost homomorphisms. Algorithms—ESA 2012, 587–598 Lecture Notes in Comput. Sci. (2012), Vol 7501, Pages
home The dichotomy of minimum cost homomorphism problems for digraphs. SIAM J. Discrete Math. (2012), Vol 26, Pages 1597–1608
home Monotone proper interval digraphs and min-max orderings. SIAM J. Discrete Math. (2012), Vol 26, Pages 1576–1596
home On edge-sets of bicliques in graphs. Discrete Appl. Math. (2012), Vol 160, Pages 2698–2708
home Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discrete Appl. Math. (2012), Vol 160, Pages 697–707
home Preface [Algebraic graph theory—a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday]. Discrete Math. (2012), Vol 312, Pages 1. 05-06
home The dichotomy of list homomorphisms for digraphs. Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011), Vol , Pages 1703-1713