Jaroslav Nesetril

Discret. Math., 2001

Construction of sparse graphs with prescribed circular colorings.

[BibT_eX]

[DOI]

Xuding Zhu

Discret. Math., 2001

I. Schur, C.E. Shannon and Ramsey Numbers, a short story.

[BibT_eX]

[DOI]

Moshe Rosenfeld

Discret. Math., 2001

A note on homomorphism-independent families.

[BibT_eX]

[DOI]

Discret. Math., 2001

Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history.

[BibT_eX]

[DOI]

Eva Milková

Helena Nesetrilová

Discret. Math., 2001

On oriented path double covers.

[BibT_eX]

[DOI]

Jana Maxová

Discret. Math., 2001

Colorings and homomorphisms of degenerate and bounded degree graphs.

[BibT_eX]

[DOI]

Petra Smolíková

Discret. Math., 2001

Vojtech Jarni'k's work in combinatorial optimization.

[BibT_eX]

[DOI]

Bernhard Korte

Discret. Math., 2001

DIMATIA surveys (related to the Fifth Czech and Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications held in Prague on July 6-11, 1998).

[BibT_eX]

[DOI]

Miroslav Fiedler

Jan Kratochvíl

Discret. Math., 2001

Foreword.

[BibT_eX]

[DOI]

Miroslav Fiedler

Jan Kratochvíl

Discret. Math., 2001

On the Oriented Game Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Towards an Aesthetic Invariant for Graph Drawing.

[BibT_eX]

[DOI]

Jan Adamec

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Counting List Homomorphisms and Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations).

[BibT_eX]

[DOI]

Claude Tardif

J. Comb. Theory B, 2000

Colored Homomorphisms of Colored Mixed Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

On covers of graphs.

[BibT_eX]

[DOI]

Jana Maxová

Electron. Notes Discret. Math., 2000

The complexity of H-colouring of bounded degree graphs.

[BibT_eX]

[DOI]

Anna Galluccio

Discret. Math., 2000

1999

On the maximum average degree and the oriented chromatic number of a graph.

[BibT_eX]

[DOI]

Oleg V. Borodin

Discret. Math., 1999

Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1999

Art of Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

A Ramsey Property of Order Types.

[BibT_eX]

[DOI]

Pavel Valtr

J. Comb. Theory A, 1998

Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth.

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

On universal graphs for planar oriented graphs of a given girth.

[BibT_eX]

[DOI]

Oleg V. Borodin

Discret. Math., 1998

Invitation to discrete mathematics.

[BibT_eX]

Jirí Matousek

Oxford University Press, ISBN: 978-0-19-850207-4, 1998

1997

Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Colorings and girth of oriented planar graphs.

[BibT_eX]

[DOI]

Jarik Nesetril

Discret. Math., 1997

Solving and Approximating Combinatorial Optimization Problems (Towards MAX CUT and TSP).

[BibT_eX]

[DOI]

Daniel Turzík

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Spectra, graphs, and proteins. Towards understanding of protein folding.

[BibT_eX]

[DOI]

Petr Pancoska

Vít Janota

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Density.

[BibT_eX]

[DOI]

Claude Tardif

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

Induced monochromatic subconfigurations.

[BibT_eX]

[DOI]

József Solymosi

Pavel Valtr

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

On bounded treewidth duality of graphs.

[BibT_eX]

[DOI]

Xuding Zhu

J. Graph Theory, 1996

High girth and extendability.

[BibT_eX]

[DOI]

Pavol Gvozdjak

Discret. Math., 1996

Complexity of Tree Homomorphisms.

[BibT_eX]

[DOI]

Xuding Zhu

Discret. Appl. Math., 1996

1994

on ordered Graphs and Graph orderings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A Ramsey-type Theorem in the Plane.

[BibT_eX]

[DOI]

Pavel Valtr

Comb. Probab. Comput., 1994

1992

Minimal asymmetric graphs of induced length 4.

[BibT_eX]

[DOI]

Gert Sabidussi

Graphs Comb., 1992

On Ramsey graphs without bipartite subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Z. Frolík and his winter schools.

[BibT_eX]

[DOI]

Discret. Math., 1992

Simple tournaments and sharply transitive groups.

[BibT_eX]

[DOI]

Wilfried Imrich

Discret. Math., 1992

The core of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

Noncrossing Subgraphs in Topological Layouts.

[BibT_eX]

[DOI]

Jan Kratochvíl

Anna Lubiw

SIAM J. Discret. Math., 1991

Extendability, Dimensions, and Diagrams of Cycle Orders.

[BibT_eX]

[DOI]

Peter Alles

Svatopluk Poljak

SIAM J. Discret. Math., 1991

Images of Rigid Digraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1991

Reorientations of covering graphs.

[BibT_eX]

[DOI]

Graham R. Brightwell

Discret. Math., 1991

1990

On Locally Presented Posets.

[BibT_eX]

[DOI]

Giorgio Gambosi

Maurizio Talamo

Theor. Comput. Sci., 1990

On the complexity of H-coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

1989

Chromatically optimal rigid graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

For graphs there are only four types of hereditary Ramsey classes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

The partite construction and ramsey set systems.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Epidemiography II. Games with a dozing yet winning player.

[BibT_eX]

[DOI]

Aviezri S. Fraenkel

J. Comb. Theory A, 1988

The chromatic connectivity of graphs.

[BibT_eX]

[DOI]

Chris D. Godsil

Richard J. Nowakowski

Graphs Comb., 1988

Linearity and Unprovability of Set Union Problem Strategies

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Postorder Hierarchy for Path Compressions and Set Union.

[BibT_eX]

[DOI]

Proceedings of the Machines, 1988

1987

On the Maximum Weight Clique Problem.

[BibT_eX]

[DOI]

Egon Balas

Vasek Chvátal

Math. Oper. Res., 1987

Local k-colorings of graphs and hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

Efficient Representation of Taxonomies.

[BibT_eX]

[DOI]

Giorgio Gambosi

Maurizio Talamo

Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Posets, Boolean Representations and Quick Path Searching.

[BibT_eX]

[DOI]

Giorgio Gambosi

Maurizio Talamo

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Large minimal sets which force long arithmetic progressions.

[BibT_eX]

[DOI]

Ronald L. Graham

J. Comb. Theory A, 1986

Finite union theorem with restrictions.

[BibT_eX]

[DOI]

Graphs Comb., 1986

On sets of integers with the Schur property.

[BibT_eX]

[DOI]

Graphs Comb., 1986

1985

Canonizing Ordering Theorems for Hales Jewett Structures.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

Two remarks on Ramsey's theorem.

[BibT_eX]

[DOI]

Discret. Math., 1985

On the use of senders in generalized ramsey theory for graphs.

[BibT_eX]

[DOI]

Stefan A. Burr

Discret. Math., 1985

1984

Some Nonstandard Ramsey Like Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Sparse Ramsey graphs.

[BibT_eX]

[DOI]

Comb., 1984

1983

Ramsey Classes of Set Systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Another Proof of the Folkman-Rado-Sanders Theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

An Extremal Problem on v-Partite Graphs.

[BibT_eX]

[DOI]

R. Paninski

H. Sachs

Eur. J. Comb., 1983

1982

Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1982

1981

Amalgamation of matroids and its applications.

[BibT_eX]

[DOI]

Svatopluk Poljak

Daniel Turzík

J. Comb. Theory B, 1981

Quotients of rigid graphs.

[BibT_eX]

[DOI]

M. E. Adams

Jirí Sichler

J. Comb. Theory B, 1981

Simple proof of the existence of restricted Ramsey graphs by means of a partite construction.

[BibT_eX]

[DOI]

Comb., 1981

Representations of Graphs by Means of Products and Their Complexity.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.

[BibT_eX]

[DOI]

Ludek Kucera

Theor. Comput. Sci., 1980

On a product dimension of graphs.

[BibT_eX]

[DOI]

László Lovász

J. Comb. Theory B, 1980

1979

A short proof of the existence of highly chromatic hypergraphs without short cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1979

1978

A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1978

On classes of relations and graphs determined by subobjects and factorobjects.

[BibT_eX]

[DOI]

Discret. Math., 1978

1977

Partitions of Finite Relational and Set Systems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

A Dushnik - Miller Type Dimension of Graphs and its Complexity.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1975

Either tournaments or algebras?

[BibT_eX]

[DOI]

Vladimír Müller

Jan Pelant

Discret. Math., 1975

1971

Homomorphisms of derivative graphs.

[BibT_eX]

[DOI]