 | 2010 |
|---|
| 25 |       | Stephan Brandt,
Kristína Budajová,
Dieter Rautenbach,
Michael Stiebitz:
Edge colouring by total labellings.
Discrete Mathematics 310(2): 199-205 (2010) |
| 24 | | Stephan Brandt:
A note on generalized pentagons.
Discrete Mathematics 310(20): 2766-2767 (2010) |
| 23 | | Stephan Brandt:
Triangle-free graphs whose independence number equals the degree.
Discrete Mathematics 310(3): 662-669 (2010) |
| 22 | | Stephan Brandt,
Janina Müttel,
Dieter Rautenbach,
Friedrich Regen:
Minimum degree and density of binary sequences.
Eur. J. Comb. 31(7): 1936-1945 (2010) |
| 21 | | Stephan Brandt,
Jozef Miskuf,
Dieter Rautenbach,
Friedrich Regen,
Imre Z. Ruzsa:
Edge-Injective and Edge-Surjective Vertex Labellings.
SIAM J. Discrete Math. 24(2): 666-683 (2010) |
| 2009 |
|---|
| 20 | | Stephan Brandt,
Jozef Miskuf,
Dieter Rautenbach:
Edge irregular total labellings for graphs of linear size.
Discrete Mathematics 309(12): 3786-3792 (2009) |
| 19 | | Stephan Brandt,
Elizabeth Ribe-Baumann:
Graphs of odd girth 7 with large degree.
Electronic Notes in Discrete Mathematics 34: 89-93 (2009) |
| 2008 |
|---|
| 18 | | Stephan Brandt,
Jozef Miskuf,
Dieter Rautenbach:
On a conjecture about edge irregular total labelings.
Journal of Graph Theory 57(4): 333-343 (2008) |
| 2006 |
|---|
| 17 | | Stephan Brandt,
Hajo Broersma,
Reinhard Diestel,
Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs.
Combinatorica 26(1): 17-36 (2006) |
| 2004 |
|---|
| 16 | | Stephan Brandt,
Mariusz Wozniak:
On Cyclic Packing of a Tree.
Graphs and Combinatorics 20(4): 435-442 (2004) |
| 15 | | Jørgen Bang-Jensen,
Stephan Brandt:
Subgraphs in vertex neighborhoods of Kr-free graphs.
Journal of Graph Theory 47(1): 29-38 (2004) |
| 2003 |
|---|
| 14 | | Stephan Brandt:
Note.
Combinatorica 23(4): 693-696 (2003) |
| 2002 |
|---|
| 13 | | Stephan Brandt:
Triangle-free graphs and forbidden subgraphs.
Discrete Applied Mathematics 120(1-3): 25-33 (2002) |
| 12 | | Stephan Brandt:
A 4-colour problem for dense triangle-free graphs.
Discrete Mathematics 251(1-3): 33-46 (2002) |
| 2000 |
|---|
| 11 | | Stephan Brandt,
Gunnar Brinkmann,
Thomas Harmuth:
The Generation of Maximal Triangle-Free Graphs.
Graphs and Combinatorics 16(2): 149-157 (2000) |
| 1999 |
|---|
| 10 | | Stephan Brandt:
9-Connected Claw-Free Graphs Are Hamilton-Connected.
J. Comb. Theory, Ser. B 75(2): 167-173 (1999) |
| 1998 |
|---|
| 9 | | Denise Amar,
Stephan Brandt,
Daniel Brito,
Oscar Ordaz:
Neighborhood conditions for balanced independent sets in bipartite graphs.
Discrete Mathematics 181(1-3): 31-36 (1998) |
| 8 | | Stephan Brandt:
The local density of triangle-free graphs.
Discrete Mathematics 183(1-3): 17-25 (1998) |
| 7 | | Stephan Brandt,
Gunnar Brinkmann,
Thomas Harmuth:
All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9.
Electr. J. Comb. 5: (1998) |
| 6 | | Stephan Brandt,
Tomaz Pisanski:
Another Infinite Sequence of Dense Triangle-Free Graphs.
Electr. J. Comb. 5: (1998) |
| 1997 |
|---|
| 5 | | Stephan Brandt:
Computing the Independence Number of Dense Triangle-Free Graphs.
WG 1997: 100-108 |
| 4 | | Stephan Brandt:
A Sufficient Condition for All Short Cycles.
Discrete Applied Mathematics 79(1-3): 63-66 (1997) |
| 1995 |
|---|
| 3 | | George R. T. Hendry,
Stephan Brandt:
An extremal problem for cycles in hamiltonian graphs.
Graphs and Combinatorics 11(3): 255-262 (1995) |
| 2 | | Stephan Brandt:
An Extremal Result for Subgraphs with Few Edges.
J. Comb. Theory, Ser. B 64(2): 288-299 (1995) |
| 1994 |
|---|
| 1 | | Stephan Brandt:
Subtrees and Subforests of Graphs.
J. Comb. Theory, Ser. B 61(1): 63-70 (1994) |
Data released under the ODC-BY 1.0 license — See also our legal information page