Search results for "Norbert W. Sauer"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Norbert W. Sauer	Vertex partitions of metric spaces with finite distance sets.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Péter Komjáth, Jean A. Larson, Norbert Sauer	The quasi order of graphs on an ordinal.	Discrete Mathematics	2011	DBLP DOI BibTeX RDF
1	Norbert Sauer, Imed Zaguia	The Order on the Rationals has an Orthogonal Order with the Same Order Type.	Order	2011	DBLP DOI BibTeX RDF
1	Claude Laflamme, Lionel Nguyen Van Thé, Maurice Pouzet, Norbert W. Sauer	Partitions and indivisibility properties of countable dimensional vector spaces.	J. Comb. Theory, Ser. A	2011	DBLP DOI BibTeX RDF
1	Norbert W. Sauer	On the General Coloring Problem.	Rainbow of Computer Science	2011	DBLP DOI BibTeX RDF
1	Claude Laflamme, Lionel Nguyen Van Thé, Norbert Sauer	Distinguishing Number of Countable Homogeneous Relational Structures.	Electr. J. Comb.	2010	DBLP BibTeX RDF
1	Lionel Nguyen Van Thé, Norbert W. Sauer	Some weak indivisibility results in ultrahomogeneous metric spaces.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
1	Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer	Partition properties of the dense local order and a colored version of Milliken's theorem.	Combinatorica	2010	DBLP DOI BibTeX RDF
1	Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer	Representation of ideals of relational structures.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer	Divisibility of countable metric spaces.	Eur. J. Comb.	2007	DBLP DOI BibTeX RDF
1	Maurice Pouzet, Norbert Sauer	From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.	Electr. J. Comb.	2006	DBLP BibTeX RDF
1	Claude Laflamme, Norbert W. Sauer, Vojkan Vuksanovic	Canonical Partitions Of Universal Structures.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03E02, 05D10
1	Norbert W. Sauer	Coloring Subgraphs of the Rado Graph.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03E02, 03E05
1	Mohamed M. El-Zahar, Norbert Sauer	Indivisible homogeneous directed graphs and a game for vertex partitions.	Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Dwight Duffus, Norbert W. Sauer	Chromatic numbers and products.	Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Norbert W. Sauer	Canonical Vertex Partitions.	Combinatorics, Probability & Computing	2003	DBLP DOI BibTeX RDF
1	Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow	On cop-win graphs.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Werner Kuich, Norbert Sauer, Friedrich J. Urbanek	Heyting Algebras and Formal Languages.	J. UCS	2002	DBLP BibTeX RDF
1	Christian Delhommé, Norbert Sauer	Homomorphisms of Products of Graphs into Graphs Without Four Cycles.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C15
1	Norbert W. Sauer	A Ramsey theorem for countable homogeneous directed graphs.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Werner Kuich, Norbert Sauer	Atoms and partial orders of infinite languages.	ITA	2001	DBLP DOI BibTeX RDF
1	Norbert Sauer	Hedetniemi's conjecture -- a survey.	Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Norbert Sauer	Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 03E02, 03C10, 05C55
1	Christian Delhommé, Maurice Pouzet, Norbert Sauer	Jump-number of Means on Graphs.	Eur. J. Comb.	2000	DBLP DOI BibTeX RDF
1	Norbert Sauer	Edge partitions of the countable triangle free homogeneous graph.	Discrete Mathematics	1998	DBLP DOI BibTeX RDF
1	Norbert Sauer, Robert E. Woodrow, Vojtech Rödl	Chromatic Ramsey Theory.	Eur. J. Comb.	1997	DBLP DOI BibTeX RDF
1	Dwight Duffus, Norbert Sauer	Lattices arising in categorial investigations of Hedetniemi's conjecture.	Discrete Mathematics	1996	DBLP DOI BibTeX RDF
1	Maurice Pouzet, Norbert Sauer	Edge Partitions of the Rado Graph.	Combinatorica	1996	DBLP DOI BibTeX RDF
1	Norbert Sauer, Jozef Sirán	The chromatic number of the union of two forests.	Ars Comb.	1996	DBLP BibTeX RDF
1	Vojtech Rödl, Norbert Sauer, Xu-Ding Zhu	Ramsey Families which Exclude a Graph.	Combinatorica	1995	DBLP DOI BibTeX RDF
1	Manfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet	Set-Homogeneous Graphs.	J. Comb. Theory, Ser. B	1994	DBLP DOI BibTeX RDF
1	Mohamed M. El-Zahar, Norbert Sauer	On the Divisibility of Homogeneous Hypergraphs.	Combinatorica	1994	DBLP DOI BibTeX RDF
1	Hong Wang 0022, Norbert Sauer	Packing Three Copies of a Tree into a Complete Graph.	Eur. J. Comb.	1993	DBLP DOI BibTeX RDF
1	David S. Gunderson, Vojtech Rödl, Norbert W. Sauer	Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.	J. Comb. Theory, Ser. B	1993	DBLP DOI BibTeX RDF
1	Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow	Two-colouring all two-element maximal antichains.	J. Comb. Theory, Ser. A	1991	DBLP DOI BibTeX RDF
1	Mohamed M. El-Zahar, Norbert W. Sauer	Ramsey-type properties of relational structures.	Discrete Mathematics	1991	DBLP DOI BibTeX RDF
1	Mohamed M. El-Zahar, Norbert Sauer	The indivisibility of the homogeneous Kn-free graphs.	J. Comb. Theory, Ser. B	1989	DBLP DOI BibTeX RDF
1	Mohamed M. El-Zahar, Norbert Sauer	The chromatic number of the product of two 4-chromatic graphs is 4.	Combinatorica	1985	DBLP DOI BibTeX RDF
1	Bill Sands, Norbert Sauer, Robert E. Woodrow	On monochromatic paths in edge-coloured digraphs.	J. Comb. Theory, Ser. B	1982	DBLP DOI BibTeX RDF
1	Norbert Sauer, Joel Spencer	Edge disjoint placement of graphs.	J. Comb. Theory, Ser. B	1978	DBLP DOI BibTeX RDF
1	Norbert Sauer	On the Density of Families of Sets.	J. Comb. Theory, Ser. A	1972	DBLP DOI BibTeX RDF

Publications of Norbert W. Sauer Norbert Sauer ( http://dblp.L3S.de/Authors/Norbert_W._Sauer )