Norbert W. Sauer
List of publications from the
| 2007 |
| 32 | EE | Christian Delhommé,
Claude Laflamme,
Maurice Pouzet,
Norbert Sauer:
Divisibility of countable metric spaces.
Eur. J. Comb. 28(6): 1746-1769 (2007) |
| 2006 |
| 31 | EE | Claude Laflamme,
Norbert W. Sauer,
Vojkan Vuksanovic:
Canonical Partitions Of Universal Structures.
Combinatorica 26(2): 183-205 (2006) |
| 30 | EE | Norbert W. Sauer:
Coloring Subgraphs of the Rado Graph.
Combinatorica 26(2): 231-253 (2006) |
| 29 | EE | Maurice Pouzet,
Norbert Sauer:
From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
| 28 | EE | Mohamed M. El-Zahar,
Norbert Sauer:
Indivisible homogeneous directed graphs and a game for vertex partitions.
Discrete Mathematics 291(1-3): 99-113 (2005) |
| 27 | EE | Dwight Duffus,
Norbert W. Sauer:
Chromatic numbers and products.
Discrete Mathematics 300(1-3): 91-99 (2005) |
| 2003 |
| 26 | | Norbert W. Sauer:
Canonical Vertex Partitions.
Combinatorics, Probability & Computing 12(5-6): 671-704 (2003) |
| 2002 |
| 25 | EE | Christian Delhommé,
Norbert Sauer:
Homomorphisms of Products of Graphs into Graphs Without Four Cycles.
Combinatorica 22(1): 35-46 (2002) |
| 24 | EE | Norbert W. Sauer:
A Ramsey theorem for countable homogeneous directed graphs.
Discrete Mathematics 253(1-3): 45-61 (2002) |
| 23 | EE | Gena Hahn,
François Laviolette,
Norbert Sauer,
Robert E. Woodrow:
On cop-win graphs.
Discrete Mathematics 258(1-3): 27-41 (2002) |
| 22 | EE | Werner Kuich,
Norbert Sauer,
Friedrich J. Urbanek:
Heyting Algebras and Formal Languages.
J. UCS 8(7): 722- (2002) |
| 2001 |
| 21 | EE | Norbert Sauer:
Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.
Combinatorica 21(2): 293-308 (2001) |
| 20 | EE | Norbert Sauer:
Hedetniemi's conjecture -- a survey.
Discrete Mathematics 229(1-3): 261-292 (2001) |
| 19 | EE | Werner Kuich,
Norbert Sauer:
Atoms and partial orders of infinite languages.
ITA 35(4): 389-401 (2001) |
| 2000 |
| 18 | EE | Christian Delhommé,
Maurice Pouzet,
Norbert Sauer:
Jump-number of Means on Graphs.
Eur. J. Comb. 21(6): 767-775 (2000) |
| 1998 |
| 17 | EE | Norbert Sauer:
Edge partitions of the countable triangle free homogeneous graph.
Discrete Mathematics 185(1-3): 137-181 (1998) |
| 1997 |
| 16 | EE | Norbert Sauer,
Robert E. Woodrow,
Vojtech Rödl:
Chromatic Ramsey Theory.
Eur. J. Comb. 18(1): 93-102 (1997) |
| 1996 |
| 15 | | Norbert Sauer,
Jozef Sirán:
The chromatic number of the union of two forests.
Ars Comb. 42: (1996) |
| 14 | | Maurice Pouzet,
Norbert Sauer:
Edge Partitions of the Rado Graph.
Combinatorica 16(4): 505-520 (1996) |
| 13 | EE | Dwight Duffus,
Norbert Sauer:
Lattices arising in categorial investigations of Hedetniemi's conjecture.
Discrete Mathematics 152(1-3): 125-139 (1996) |
| 1995 |
| 12 | | Vojtech Rödl,
Norbert Sauer,
Xu-Ding Zhu:
Ramsey Families which Exclude a Graph.
Combinatorica 15(4): 589-596 (1995) |
| 1994 |
| 11 | | Mohamed M. El-Zahar,
Norbert Sauer:
On the Divisibility of Homogeneous Hypergraphs.
Combinatorica 14(2): 159-165 (1994) |
| 10 | EE | Manfred Droste,
Dugald Macpherson,
Norbert Sauer,
Michèle Giraudet:
Set-Homogeneous Graphs.
J. Comb. Theory, Ser. B 62(1): 63-95 (1994) |
| 1993 |
| 9 | EE | Hong Wang,
Norbert Sauer:
Packing Three Copies of a Tree into a Complete Graph.
Eur. J. Comb. 14(2): 137-142 (1993) |
| 8 | EE | David S. Gunderson,
Vojtech Rödl,
Norbert W. Sauer:
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.
J. Comb. Theory, Ser. B 59(2): 199-209 (1993) |
| 1991 |
| 7 | EE | Mohamed H. El-Zahar,
Norbert W. Sauer:
Ramsey-type properties of relational structures.
Discrete Mathematics 94(1): 1-10 (1991) |
| 6 | EE | Dwight Duffus,
Bill Sands,
Norbert Sauer,
Robert E. Woodrow:
Two-colouring all two-element maximal antichains.
J. Comb. Theory, Ser. A 57(1): 109-116 (1991) |
| 1989 |
| 5 | EE | Mohamed M. El-Zahar,
Norbert Sauer:
The indivisibility of the homogeneous Kn-free graphs.
J. Comb. Theory, Ser. B 47(2): 162-170 (1989) |
| 1985 |
| 4 | | Mohamed M. El-Zahar,
Norbert Sauer:
The chromatic number of the product of two 4-chromatic graphs is 4.
Combinatorica 5(2): 121-126 (1985) |
| 1982 |
| 3 | EE | Bill Sands,
Norbert Sauer,
Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory, Ser. B 33(3): 271-275 (1982) |
| 1978 |
| 2 | EE | Norbert Sauer,
Joel Spencer:
Edge disjoint placement of graphs.
J. Comb. Theory, Ser. B 25(3): 295-302 (1978) |
| 1972 |
| 1 | | Norbert Sauer:
On the Density of Families of Sets.
J. Comb. Theory, Ser. A 13(1): 145-147 (1972) |