| Publication | Date of Publication | Type |
|---|
| On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one | 2024-07-05 | Paper |
Cartesian products of graphs as spanning subgraphs of de Bruijn graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Classes of locally finite ubiquitous graphs
Journal of Combinatorial Theory. Series B | 2013-04-17 | Paper |
On self‐immersions of infinite graphs
Journal of Graph Theory | 2009-06-04 | Paper |
Reconstructing the number of blocks of an infinite graph
Discrete Mathematics | 2005-09-22 | Paper |
On immersions of uncountable graphs
Journal of Combinatorial Theory. Series B | 2003-08-20 | Paper |
On the immersion relation and an embedding problem for infinite graphs
Results in Mathematics | 2002-12-02 | Paper |
On disjoint configurations in infinite graphs
Journal of Graph Theory | 2002-07-01 | Paper |
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
Networks | 2001-10-14 | Paper |
On the clique-transversal number of chordal graphs
Discrete Mathematics | 2000-11-02 | Paper |
A two-person game on graphs where each player tries to encircle his opponent's men
Theoretical Computer Science | 1999-04-28 | Paper |
Embedding Cartesian products of graphs into de Bruijn graphs
Journal of Parallel and Distributed Computing | 1998-08-30 | Paper |
Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
Discrete Applied Mathematics | 1998-05-04 | Paper |
On reconstructing rooted trees
Journal of Combinatorial Theory. Series B | 1997-05-28 | Paper |
On covering all cliques of a chordal graph
Discrete Mathematics | 1996-03-26 | Paper |
On independent cycles and edges in graphs
Discrete Mathematics | 1996-03-26 | Paper |
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
SIAM Journal on Discrete Mathematics | 1995-05-04 | Paper |
Minimum transversals of maximum matchings as approximate solutions to the bisection problem
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 1995-01-01 | Paper |
On a problem concerning tolerance graphs
Discrete Applied Mathematics | 1994-01-16 | Paper |
Some results on visibility graphs
Discrete Applied Mathematics | 1993-01-17 | Paper |
A search problem on graphs which generalizes some group testing problems with two defectives
Discrete Mathematics | 1992-06-25 | Paper |
Clique-transversal sets of line graphs and complements of line graphs
Discrete Mathematics | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4181393 (Why is no real title available?) | 1990-01-01 | Paper |
The total interval number of a graph
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
A ternary search problem on graphs
Discrete Applied Mathematics | 1989-01-01 | Paper |
On the unit interval number of a graph
Discrete Applied Mathematics | 1988-01-01 | Paper |
A remark on perfect Gaussian elimination of symmetric matrices
European Journal of Combinatorics | 1988-01-01 | Paper |
On the Interval Number of a Triangulated Graph
Journal of Graph Theory | 1987-01-01 | Paper |
On a pursuit game played on graphs for which a minor is excluded
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
On an extremal problem concerning the interval number of a graph
Discrete Applied Mathematics | 1986-01-01 | Paper |
On well-quasi-ordering-finite graphs by immersion
Combinatorica | 1986-01-01 | Paper |
On the degrees of vertices in locally finite graphs which possess a certain edge deletion property
Archiv der Mathematik | 1985-01-01 | Paper |
On the edge reconstruction of locally finite disconnected graphs with a finite number of components
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 1985-01-01 | Paper |
On superperfect noncomparability graphs
Journal of Graph Theory | 1985-01-01 | Paper |
Note on a pursuit game played on graphs
Discrete Applied Mathematics | 1984-01-01 | Paper |
An edge-deletion problem for locally finite graphs
Journal of Combinatorial Theory. Series B | 1982-01-01 | Paper |
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
Journal of Combinatorial Theory. Series B | 1982-01-01 | Paper |
Reconstructing the degree sequence and the number of components of an infinite graph
Discrete Mathematics | 1982-01-01 | Paper |
Note on the reconstruction of infinite graphs with a fixed finite number of components
Journal of Graph Theory | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3775572 (Why is no real title available?) | 1982-01-01 | Paper |
On the reconstruction of locally finite trees
Journal of Graph Theory | 1981-01-01 | Paper |
Über maximale Systeme von kantendisjunkten unendlichen Wegen in Graphen
Mathematische Nachrichten | 1981-01-01 | Paper |
Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees)
Journal of Combinatorial Theory. Series B | 1979-01-01 | Paper |
Matroidal families of finite connected nonhomeomorphic graphs exist
Journal of Graph Theory | 1978-01-01 | Paper |
On a problem of R. Halin concerning infinite graphs
Discrete Mathematics | 1978-01-01 | Paper |
Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3540834 (Why is no real title available?) | 1977-01-01 | Paper |
