The SCEAS System
| |||||||

## Search the dblp DataBase
Norbert Sauer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Norbert Sauer, Jozef Sirán
**The chromatic number of the union of two forests.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1996, v:42, n:, pp:- [Journal] - Christian Delhommé, Norbert Sauer
**Homomorphisms of Products of Graphs into Graphs Without Four Cycles.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2002, v:22, n:1, pp:35-46 [Journal] - Mohamed M. El-Zahar, Norbert Sauer
**The chromatic number of the product of two 4-chromatic graphs is 4.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1985, v:5, n:2, pp:121-126 [Journal] - Mohamed M. El-Zahar, Norbert Sauer
**On the Divisibility of Homogeneous Hypergraphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1994, v:14, n:2, pp:159-165 [Journal] - Norbert Sauer
**Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2001, v:21, n:2, pp:293-308 [Journal] - Maurice Pouzet, Norbert Sauer
**Edge Partitions of the Rado Graph.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:4, pp:505-520 [Journal] - Vojtech Rödl, Norbert Sauer, Xu-Ding Zhu
**Ramsey Families which Exclude a Graph.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1995, v:15, n:4, pp:589-596 [Journal] - Mohamed M. El-Zahar, Norbert Sauer
**Indivisible homogeneous directed graphs and a game for vertex partitions.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:291, n:1-3, pp:99-113 [Journal] - Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow
**On cop-win graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:27-41 [Journal] - Norbert Sauer
**Hedetniemi's conjecture -- a survey.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:229, n:1-3, pp:261-292 [Journal] - Christian Delhommé, Maurice Pouzet, Norbert Sauer
**Jump-number of Means on Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2000, v:21, n:6, pp:767-775 [Journal] - Norbert Sauer, Robert E. Woodrow, Vojtech Rödl
**Chromatic Ramsey Theory.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:1, pp:93-102 [Journal] - Hong Wang, Norbert Sauer
**Packing Three Copies of a Tree into a Complete Graph.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1993, v:14, n:2, pp:137-142 [Journal] - Werner Kuich, Norbert Sauer
**Atoms and partial orders of infinite languages.**[Citation Graph (0, 0)][DBLP] ITA, 2001, v:35, n:4, pp:389-401 [Journal] - Manfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet
**Set-Homogeneous Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:63-95 [Journal] - Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow
**Two-colouring all two-element maximal antichains.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1991, v:57, n:1, pp:109-116 [Journal] - Mohamed M. El-Zahar, Norbert Sauer
**The indivisibility of the homogeneous**[Citation Graph (0, 0)][DBLP]*K*_{n}-free graphs. J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:162-170 [Journal] - Bill Sands, Norbert Sauer, Robert E. Woodrow
**On monochromatic paths in edge-coloured digraphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:271-275 [Journal] - Norbert Sauer
**On the Density of Families of Sets.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1972, v:13, n:1, pp:145-147 [Journal] - Norbert Sauer, Joel Spencer
**Edge disjoint placement of graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:295-302 [Journal] - Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
**Heyting Algebras and Formal Languages.**[Citation Graph (0, 0)][DBLP] J. UCS, 2002, v:8, n:7, pp:722-0 [Journal] - Norbert Sauer
**Edge partitions of the countable triangle free homogeneous graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:185, n:1-3, pp:137-181 [Journal] - Dwight Duffus, Norbert Sauer
**Lattices arising in categorial investigations of Hedetniemi's conjecture.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:152, n:1-3, pp:125-139 [Journal] **From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.**[Citation Graph (, )][DBLP]**Representation of ideals of relational structures.**[Citation Graph (, )][DBLP]**Divisibility of countable metric spaces.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |