
Rigid undirected graphs with given number of vertices. Comment. Math. Univ. Carolinae (1968), Vol 9, Pages 5169 

Broadcasting in one dimension. Discrete Appl. Math. (1988), Vol 21, Pages 101111


On restricted twofactors. SIAM J. Discrete Math. (1988), Vol 1, Pages 472484


Bandwidth versus bandsize. Ann. Discrete Math. (1989), Vol , Pages 117129 

The existence problem for graph homomorphisms. Ann. Discrete Math. (1989), Vol , Pages 255265 

Universality of directed graphs of a given height. Arch. Math. (Brno) (1989), Vol 25, Pages 4754


The effect of two cycles on the complexity of colourings by directed graphs. Discrete Appl. Math. (1990), Vol 26, Pages 123


On the complexity of $H$coloring. J. Combin. Theory Ser. B (1990), Vol 48, Pages 92110


A note on the star chromatic number. J. Graph Theory (1990), Vol 14, Pages 479482


A simple existence criterion for $(g


Local tournaments and proper circular arc graphs. Lecture Notes in Comput. Sci. (1990), Vol , Pages 101108


Images of rigid digraphs. European J. Combin. (1991), Vol 12, Pages 3342


Broadcasting in bounded degree graphs. SIAM J. Discrete Math. (1992), Vol 5, Pages 1024


Sparse broadcast graphs. Discrete Appl. Math. (1992), Vol 36, Pages 97130


Achromatic numbers and graph operations. Discrete Math. (1992), Vol 108, Pages 297305


On the complexity of colouring by superdigraphs of bipartite graphs. Discrete Math. (1992), Vol 109, Pages 2744


The core of a graph. Discrete Math. (1992), Vol 109, Pages 117126


Fast algorithms for finding Hamiltonian paths and cycles in intournament digraphs. Discrete Appl. Math. (1993), Vol 41, Pages 7579


Universality of $A$mote graphs. European J. Combin. (1993), Vol 14, Pages 2327


Algorithms for degree constrained graph factors of minimum deficiency. J. Algorithms (1993), Vol 14, Pages 115138


The complexity of colouring by semicomplete digraphs. SIAM J. Discrete Math. (1988), Vol 1, Pages 281298


Une minoration asymptotique des nombres de Schur généralisés et de certains nombres de Ramsey. C. R. Acad. Sci. Paris Sér. AB (1970), Vol 270, Pages A1477A147 

Graphs and $k$societies. Canad. Math. Bull. (1970), Vol 13, Pages 375381


Every finite graph is a full subgraph of a rigid graph. J. Combinatorial Theory Ser. B (1971), Vol 11, Pages 284286 

Graph decompositions, handcuffed prisoners and balanced $P$designs. Discrete Math. (1972), Vol 2, Pages 229252


Full embeddings into some cateogries of graphs. Algebra Universalis (1972), Vol 2, Pages 129141


Groups and monoids of regular graphs (and of graphs with bounded degrees). Canad. J. Math. (1973), Vol 25, Pages 239251


Generalized Ramsey theory for graphs. V. The Ramsey number of a digraph. Bull. London Math. Soc. (1974), Vol 6, Pages 175182


On some strongly rigid families of graphs and the full embedding they induce. Algebra Universalis (1974), Vol 4, Pages 108126


Absolute planar retracts and the four color conjecture. J. Combinatorial Theory Ser. B (1974), Vol 17, Pages 510 

Absolute retracts in graphs. Lecture Notes in Math. (1974), Vol 406, Pages 291301 

Corrections: "Generalized Ramsey theory for graphs. Bull. London Math. Soc. (1975), Vol 7, Pages 8788


Subdirect products of bipartite graphs. Colloq. Math. Soc. (1975), Vol , Pages 857866 

Some results on the Oberwolfach problem (decomposition of complete graphs into isomorphic quadratic factors). Aequationes Math. (1975), Vol 12, Pages 15


On some independence results in graph theory. Proceedings of the Conference on Algebraic Aspects of Combinatorics (1975), Vol , Pages 89122 

On forbidden quotients and the achromatic number. Proceedings of the Fifth British Combinatorial Conference (1976), Vol , Pages 283292 

On the density of sets containing no $k$element arithmetic progression of a certain kind. J. London Math. Soc. (2) (1976), Vol 13, Pages 226234


Graph with given achromatic number. Discrete Math. (1976), Vol 16, Pages 195207


Graph retractions. Accad. Naz. (1976), Vol , Pages 263268 

Homomorphisms of graphs and of their orientations. Monatsh. Math. (1978), Vol 85, Pages 3948


On the completeness of a generalized matching problem. Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (1978), Vol , Pages 240245 

Partial joins and graphs with given group, order, and size. Congress. Numer. (1978), Vol , Pages 357371 

Graphs with given neighborhoods. I. Colloq. Internat. CNRS (1978), Vol , Pages 219223 

Cohomomorphisms of graphs and hypergraphs. Math. Nachr. (1979), Vol 87, Pages 5361


On the edgesets of rigid and corigid graphs. Math. Nachr. (1979), Vol 87, Pages 6369


Collecting autographs: $n$node graphs that have $n$integer signatures. Ann. New York Acad. Sci. (1979), Vol , Pages 93102 

An introduction to the category of graphs. Ann. New York Acad. Sci. (1979), Vol , Pages 120136 

Graphs with forbidden homomorphic images. Ann. New York Acad. Sci. (1979), Vol , Pages 270280 

An intermediate value theorem for graphs with given automorphism group. J. Graph Theory (1979), Vol 3, Pages 3541


Graphs and parallel comparison algorithms. Congr. Numer. (1980), Vol 29, Pages 497509 

Parallel sorting with constant time for comparisons. SIAM J. Comput. (1981), Vol 10, Pages 465472


Scheduling, matching, and coloring. Colloq. Math. Soc. Janos Bolyai (1981), Vol , Pages 273279 

On generalized matching problems. Inform. Process. Lett. (1981), Vol 12, Pages 3335


Sorting and merging in rounds. SIAM J. Algebraic Discrete Methods (1982), Vol 3, Pages 465473 

Homomorphism interpolation and approximation. NorthHolland Math. Stud. (1982), Vol , Pages 213227 

Analogues of the Shannon capacity of a graph. NorthHolland Math. Stud. (1982), Vol , Pages 155168 

On the complexity of general graph factor problems. SIAM J. Comput. (1983), Vol 12, Pages 601609


Counterexamples to theorems of Menger type for the diameter. Discrete Math. (1983), Vol 44, Pages 217220


The complexity of finding generalized paths in tournaments. J. Algorithms (1983), Vol 4, Pages 303309


Packings by cliques and by finite families of graphs. Discrete Math. (1984), Vol 49, Pages 4559


Broadcasting in grid graphs with given neighborhood templates. Congr. Numer. (1984), Vol 41, Pages 295298 

Matroids with weighted bases and Feynman integrals. NorthHolland Math. Stud. (1984), Vol , Pages 165175 

On the history of the minimum spanning tree problem. Ann. Hist. Comput. (1985), Vol 7, Pages 4357 

Sorting and graphs. NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. (1985), Vol , Pages 169184 

Concerning the achromatic number of graphs. J. Combin. Theory Ser. B (1996), Vol 40, Pages 2139


Packings by complete bipartite graphs. SIAM J. Algebraic Discrete Methods (1986), Vol 7, Pages 199209 

On subRamsey numbers. Ars Combin. (1986), Vol 22, Pages 199206 

Jump number and width. Order (1986), Vol 3, Pages 227234


A note on $f$factors in directed and undirected multigraphs. Graphs Combin. (1986), Vol 2, Pages 6166


On the problem of bandsize. Graphs Combin. (1987), Vol 3, Pages 279284


Absolute retracts and varieties of reflexive graphs. Canad. J. Math. (1987), Vol 39, Pages 544567


On multiplicative graphs and the product conjecture. Combinatorica (1988), Vol 8, Pages 6374


Graph endpoint coloring and distributed processing. Networks (1993), Vol 23, Pages 9398


Largest planar graphs of diameter two and fixed maximum degree. Discrete Math. (1993), Vol 111, Pages 313322


Biography of Martin Farber Discrete Appl. Math. (1993), Vol 44, Pages 57


Absolute reflexive retracts and absolute bipartite retracts. Discrete Appl. Math. (1993), Vol 44, Pages 920


On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. J. Graph Theory (1993), Vol 17, Pages 647655


Homomorphisms to oriented cycles. Combinatorica (1993), Vol 13, Pages 421433


Multiplicativity of oriented cycles. J. Combin. Theory Ser. B (1994), Vol 60, Pages 239253


On chordal proper circular arc graphs. Discrete Math. (1994), Vol 128, Pages 395398


Independence ratios of graph powers. Discrete Math. (1994), Vol 127, Pages 213220


Packing problems in edgecolored graphs. Discrete Appl. Math. (1994), Vol 52, Pages 295306


Homomorphisms to oriented paths. Discrete Math. (1994), Vol 132, Pages 107114


Optimal recognition of local tournaments. Congr. Numer. (1994), Vol 100, Pages 141146 

Hereditarily hard $H$colouring problems. Discrete Math. (1995), Vol 138, Pages 7592


Equicovering matroids by distinct bases. European J. Combin. (1995), Vol 16, Pages 159162


The existence of homomorphisms to oriented cycles. SIAM J. Discrete Math. (1995), Vol 8, Pages 208222


On the ultimate independence ratio of a graph. European J. Combin. (1995), Vol 16, Pages 253261


Large planar graphs with given diameter and maximum degree. Discrete Appl. Math. (1995), Vol 61, Pages 133153


Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs. J. Graph Theory (1995), Vol 20, Pages 361374


On homomorphisms to acyclic local tournaments. J. Graph Theory (1995), Vol 20, Pages 467471


Duality and polynomial testing of tree homomorphisms. Trans. Amer. Math. Soc. (1996), Vol 348, Pages 12811297


Lineartime representation algorithms for proper circulararc graphs and proper interval graphs. SIAM J. Comput. (1996), Vol 25, Pages 390403


A linear algorithm for maximum weight cliques in proper circular arc graphs. SIAM J. Discrete Math. (1996), Vol 9, Pages 274289


Duality of graph homomorphisms. Bolyai Soc. Math. Stud. (1996), Vol , Pages 271282 

Rounding in symmetric matrices and undirected graphs. Discrete Appl. Math. (1996), Vol 70, Pages 121


Complexity of tree homomorphisms. Discrete Appl. Math. (1996), Vol 70, Pages 2336


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 6773


Two remarks on circular arc graphs. Graphs Combin. (1997), Vol 13, Pages 6572


The complexity of restricted graph homomorphisms. Discrete Math. (1997), Vol 167/168, Pages 145154


Colouring paths in directed symmetric trees with applications to WDM routing. Lecture Notes in Comput. Sci. (1997), Vol , Pages 505515


List homomorphisms to reflexive graphs. J. Combin. Theory Ser. B (1998), Vol 72, Pages 236250


On the complexity of coloring areflexive $h$ary relations with given permutation group. Ars Combin. (1998), Vol 48, Pages 111128 

Broadcasting in planar graphs. Australas. J. Combin. (1998), Vol 17, Pages 309318


Optimal wavelengthrouted multicasting. Discrete Appl. Math. (1998), Vol 84, Pages 1520


Constructions of large planar networks with given degree and diameter. Networks (1998), Vol 32, Pages 275281


A fully dynamic algorithm for recognizing and representing proper interval graphs. Lecture Notes in Comput. Sci. (1999), Vol , Pages 527539


List homomorphisms and circular arc graphs. Combinatorica (1999), Vol 19, Pages 487505


Complexity of graph partition problems. Annual ACM Symposium on Theory of Computing (1999), Vol , Pages 464472 

The circular chromatic number of seriesparallel graphs. J. Graph Theory (2000), Vol 33, Pages 1424


The complexity of $H$colouring of bounded degree graphs. Discrete Math. (2000), Vol 22, Pages 101109


Threeandmore set theorems. Comment. Math. Univ. Carolin. (2000), Vol 41, Pages 793801


On homomorphisms to edgecoloured cycles. Electron. Notes Discrete Math. (2000), Vol , Pages 4


Graph packings. Electron. Notes Discrete Math. (2000), Vol , Pages 4


On nice graphs. Discrete Math. (2001), Vol 234, Pages 3951


Highgirth graphs avoiding a minor are nearly bipartite. J. Combin. Theory Ser. B (2001), Vol 83, Pages 114


A fully dynamic algorithm for recognizing and representing proper interval graphs. SIAM J. Comput. (2001), Vol 31, Pages 289305


Coloring all directed paths in a symmetric tree, with an application to optical networks. J. Graph Theory (2001), Vol 38, Pages 183196


On generalized split graphs. Electron. Notes Discrete Math. (2001), Vol , Pages 4


Antidirected Hamiltonian paths between specified vertices of a tournament. Discrete Appl. Math. (2002), Vol 117, Pages 8798


Homomorphisms to powers of digraphs. Discrete Math. (2002), Vol 244, Pages 3141


Partitioning chordal graphs into independent sets and cliques. TEMA Tend. Mat. Apl. Comput. (2002), Vol 3, Pages 147155


Spanning trees with bounded number of branch vertices. Lecture Notes in Comput. Sci. (2002), Vol , Pages 355365


Biarc graphs and the complexity of list homomorphisms. J. Graph Theory (2003), Vol 42, Pages 6180


List partitions. SIAM J. Discrete Math. (2003), Vol 16, Pages 449478


Broadcasting in generalized chordal rings. Networks (2003), Vol 42, Pages 123134


Packing paths in digraphs. J. Graph Theory (2003), Vol 44, Pages 8194


Algorithmic aspects of graph homomorphisms. London Math. Soc. Lecture Note Ser. (2003), Vol , Pages 239276 

Acyclic homomorphisms and circular colorings of digraphs. SIAM J. Discrete Math. (2003), Vol 17, Pages 161169


Counting list homomorphisms for graphs with bounded degrees. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. (2004), Vol , Pages 105112 

Partitioning chordal graphs into independent sets and cliques. Discrete Appl. Math. (2004), Vol 141, Pages 185194


Interval bigraphs and circular arc graphs. J. Graph Theory (2004), Vol 46, Pages 313327


Polychromatic cliques. Discrete Math. (2004), Vol 285, Pages 319322


Spanning spiders and lightsplitting switches. Discrete Math. (2004), Vol 285, Pages 8395


Graphs and homomorphisms. Oxford Lecture Ser. Math. Appl. (2004), Vol , Pages


List partitions of chordal graphs. Lecture Notes in Comput. Sci. (2004), Vol , Pages 100108


Certifying LexBFS recognition algorithms for proper interval graphs and proper interval bigraphs. SIAM J. Discrete Math. (2004/05), Vol 18, Pages 554570


A generalization of the theorem of Lekkerkerker and Boland. Discrete Math. (2005), Vol 299, Pages 113119


Packing $r$cliques in weighted chordal graphs. Ann. Oper. Res. (2005), Vol 138, Pages 179187


List matrix partitions of chordal graphs. Theoret. Comput. Sci. (2005), Vol 349, Pages 5266


Two algorithms for general list matrix partitions. Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms (2005), Vol , Pages 870876 

Independent packings in structured graphs. Math. Program. (2006), Vol 105, Pages 201213


Full constraint satisfaction problems. SIAM J. Comput. (2006), Vol 36, Pages 230246


The $k$piece packing problem. J. Graph Theory (2006), Vol 52, Pages 267293


From graph colouring to constraint satisfaction: there and back again. Algorithms Combin. (2006), Vol , Pages 407432


Matrix partitions of perfect graphs. Discrete Math. (2006), Vol 306, Pages 24502460


Digraph matrix partitions and trigraph homomorphisms. Discrete Appl. Math. (2006), Vol 154, Pages 24582469


List homomorphisms of graphs with bounded degrees. Discrete Math. (2007), Vol 307, Pages 386392


The structure of biarc trees. Discrete Math. (2007), Vol 307, Pages 393401


Generalized colourings (matrix partitions) of cographs. Trends Math. (2007), Vol , Pages 149167 

On the density of trigraph homomorphisms. Graphs Combin. (2007), Vol 23, Pages 275281


Matrix partitions with finitely many obstructions. Electron. Notes Discrete Math. (2007), Vol , Pages 371378


Matrix partitions with finitely many obstructions. Electron. J. Combin. (2007), Vol 14, Pages 17


Brookstype theorems for pairlist colorings and list homomorphisms. SIAM J. Discrete Math. (2008), Vol 22, Pages 114


On realizations of point determining graphs, and obstructions to full homomorphisms. Discrete Math. (2008), Vol 308, Pages 16391652


Oriented star packings. J. Combin. Theory Ser. B (2008), Vol 98, Pages 558576


A dichotomy for minimum cost graph homomorphisms. European J. Combin. (2008), Vol 29, Pages 900911


On the adaptable chromatic number of graphs. European J. Combin. (2008), Vol 29, Pages 912921


Nearunanimity functions and varieties of reflexive graphs. SIAM J. Discrete Math. (2008), Vol 22, Pages 938960


Polarity of chordal graphs. Discrete Appl. Math. (2008), Vol 156, Pages 24692479


Minimum cost homomorphisms to reflexive digraphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 182193


On injective colourings of chordal graphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 520530


Generalized colourings and matrix partitions. Ramanujan Math. Soc. Lect. Notes Ser. (2008), Vol , Pages 141148 

Extension problems with degree bounds. Discrete Appl. Math. (2009), Vol 157, Pages 15921599


Lineartime certifying algorithms for neargraphical sequences. Discrete Math. (2009), Vol 309, Pages 57035713


Adaptable chromatic number of graph products. Discrete Math. (2009), Vol 309, Pages 61536159


Adjusted interval digraphs. Electron. Notes Discrete Math. (2009), Vol , Pages 8391


Cycle transversals in bounded degree graphs. Electron. Notes Discrete Math. (2009), Vol , Pages 189195


Retractions to pseudoforests. SIAM J. Discrete Math. (2010), Vol 24, Pages 101112


Messy broadcasting—decentralized broadcast schemes with limited knowledge. Discrete Appl. Math. (2011), Vol 159, Pages 322327


Dichotomy for treestructured trigraph list homomorphism problems. Discrete Appl. Math. (2011), Vol 159, Pages 12171224


Cycle transversals in bounded degree graphs. Discrete Math. Theor. Comput. Sci. (2011), Vol 13, Pages 4566


Blocking quadruple: a new obstruction to circulararc graphs. SIAM J. Discrete Math. (2014), Vol 28, Pages 631–655


On the complexity of the 3kernel problem in some classes of digraphs. Discuss. Math. Graph Theory (2014), Vol 34, Pages 167–185


Matrix partitions of split graphs. Discrete Appl. Math. (2014), Vol 166, Pages 91–96


A simple combinatorial interpretation of certain generalized Bell and Stirling numbers. Discrete Math. (2014), Vol 318, Pages 53–57


Semilattice polymorphisms and chordal graphs. European J. Combin. (2014), Vol 36, Pages 694–706


Graph partitions with prescribed patterns. European J. Combin. (2014), Vol 35, Pages 335–353


Graphs admitting k NU operations. Part 1: The reflexive case. SIAM J. Discrete Math. (2013), Vol 27, Pages 1940–1963


Recognition and characterization of chronological interval digraphs. Electron. J. Combin. (2013), Vol 20, Pages Paper 5,


Obstructions to partitions of chordal graphs. Discrete Math. (2013), Vol 313, Pages 1861–1871


Approximation of minimum cost homomorphisms. Algorithms—ESA 2012, 587–598 Lecture Notes in Comput. Sci. (2012), Vol 7501, Pages


The dichotomy of minimum cost homomorphism problems for digraphs. SIAM J. Discrete Math. (2012), Vol 26, Pages 1597–1608


Monotone proper interval digraphs and minmax orderings. SIAM J. Discrete Math. (2012), Vol 26, Pages 1576–1596


On edgesets of bicliques in graphs. Discrete Appl. Math. (2012), Vol 160, Pages 2698–2708


Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discrete Appl. Math. (2012), Vol 160, Pages 697–707


Preface [Algebraic graph theory—a volume dedicated to Gert Sabidussi on the occasion of his 80th birthday]. Discrete Math. (2012), Vol 312, Pages 1. 0506


The dichotomy of list homomorphisms for digraphs. Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms (2011), Vol , Pages 17031713 