The following pages link to Thomas Andreae (Q689954):
Displaying 50 items.
- On a problem concerning tolerance graphs (Q689957) (← links)
- Note on a pursuit game played on graphs (Q799702) (← links)
- A characterization of matroidal families of multigraphs (Q801074) (← links)
- Clique-transversal sets of line graphs and complements of line graphs (Q810533) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- (Q914703) (redirect page) (← links)
- Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture (Q914704) (← links)
- On the degrees of vertices in locally finite graphs which possess a certain edge deletion property (Q1068850) (← links)
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components (Q1071035) (← links)
- On an extremal problem concerning the interval number of a graph (Q1084408) (← links)
- Cops and robbers in graphs with large girth and Cayley graphs (Q1092060) (← links)
- On a pursuit game on Cayley digraphs (Q1100216) (← links)
- On a pursuit game played on graphs for which a minor is excluded (Q1101027) (← links)
- On a property of graphs containing infinitely many isomorphic copies of themselves (Q1104344) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
- The reconstruction for separable graphs with 2-connected trunks that are series-parallel networks (Q1109052) (← links)
- A note on the vertex-switching reconstruction (Q1114710) (← links)
- A ternary search problem on graphs (Q1118418) (← links)
- The total interval number of a graph (Q1119605) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- Reconstructing the degree sequence and the number of components of an infinite graph (Q1147163) (← links)
- Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs (Q1168334) (← links)
- An edge-deletion problem for locally finite graphs (Q1172650) (← links)
- A search problem on graphs which generalizes some group testing problems with two defectives (Q1176719) (← links)
- Reconstruction of locally finite connected graphs with two infinite wings (Q1182943) (← links)
- Reconstruction of sequences (Q1182969) (← links)
- Reconstruction of infinite graphs (Q1191922) (← links)
- Some results on visibility graphs (Q1201816) (← links)
- Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees) (Q1233440) (← links)
- On a problem of R. Halin concerning infinite graphs (Q1246547) (← links)
- Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen (Q1247441) (← links)
- Linear algorithm for domatic number problem on interval graphs (Q1262139) (← links)
- A remark on perfect Gaussian elimination of symmetric matrices (Q1262880) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- On reconstructing rooted trees (Q1338309) (← links)
- Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three (Q1372727) (← links)
- Embedding Cartesian products of graphs into de Bruijn graphs (Q1384400) (← links)
- On immersions of uncountable graphs (Q1403913) (← links)
- Reconstruction of infinite locally finite connected graphs (Q1406548) (← links)
- On the clique-transversal number of chordal graphs (Q1584423) (← links)
- On the immersion relation and an embedding problem for infinite graphs (Q1601389) (← links)
- (Q1813736) (redirect page) (← links)
- Graphs self-complementary in \(K_ n-e\) (Q1813737) (← links)
- On the reconstruction of the matching polynomial and the reconstruction conjecture (Q1820796) (← links)
- On a game of policemen and robber (Q1820799) (← links)
- On digraph reconstruction (Q1825206) (← links)
- Maximizing the sum of the squares of the degrees of a graph (Q1877650) (← links)
- On independent cycles and edges in graphs (Q1910587) (← links)
- On covering all cliques of a chordal graph (Q1910588) (← links)
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
