Stephan Brandt

According to our database1, Stephan Brandt authored at least 35 papers between 1994 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
The Total Irregularity of a Graph.
Discret. Math. Theor. Comput. Sci., 2014

On degree sums of a triangle-free graph.
Discret. Math., 2014

The circumference of the square of a connected graph.
Comb., 2014

2013
Ramsey Results for Cycle Spectra.
J. Graph Theory, 2013

Cycles in squares of trees without generalized claws.
Discret. Math., 2013

Cycles and Paths in Triangle-Free Graphs.
Proceedings of the Mathematics of Paul Erdős II, 2013

2010
Edge-Injective and Edge-Surjective Vertex Labellings.
SIAM J. Discret. Math., 2010

Minimum degree and density of binary sequences.
Eur. J. Comb., 2010

Edge colouring by total labellings.
Discret. Math., 2010

A note on generalized pentagons.
Discret. Math., 2010

Triangle-free graphs whose independence number equals the degree.
Discret. Math., 2010

2009
Graphs of odd girth 7 with large degree.
Electron. Notes Discret. Math., 2009

Edge irregular total labellings for graphs of linear size.
Discret. Math., 2009

2008
On a conjecture about edge irregular total labelings.
J. Graph Theory, 2008

2006
Global Connectivity And Expansion: Long Cycles and Factors In <i>f</i>-Connected Graphs.
Comb., 2006

2004
Subgraphs in vertex neighborhoods of <i>K<sub>r</sub></i>-free graphs.
J. Graph Theory, 2004

On Cyclic Packing of a Tree.
Graphs Comb., 2004

2003
Comb., 2003

2002
A 4-colour problem for dense triangle-free graphs.
Discret. Math., 2002

Triangle-free graphs and forbidden subgraphs.
Discret. Appl. Math., 2002

2000
Closure and stable Hamiltonian properties in claw-free graphs.
J. Graph Theory, 2000

The Generation of Maximal Triangle-Free Graphs.
Graphs Comb., 2000

1999
9-Connected Claw-Free Graphs Are Hamilton-Connected.
J. Comb. Theory, Ser. B, 1999

1998
Weakly pancyclic graphs.
J. Graph Theory, 1998

The local density of triangle-free graphs.
Discret. Math., 1998

Neighborhood conditions for balanced independent sets in bipartite graphs.
Discret. Math., 1998

Another Infinite Sequence of Dense Triangle-Free Graphs.
Electron. J. Comb., 1998

All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9.
Electron. J. Comb., 1998

1997
Degree conditions for 2-factors.
J. Graph Theory, 1997

A Sufficient Condition for All Short Cycles.
Discret. Appl. Math., 1997

Computing the Independence Number of Dense Triangle-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996
The Erdős-Sós conjecture for graphs of girth 5.
Discret. Math., 1996

1995
An Extremal Result for Subgraphs with Few Edges.
J. Comb. Theory, Ser. B, 1995

An extremal problem for cycles in hamiltonian graphs.
Graphs Comb., 1995

1994
Subtrees and Subforests of Graphs.
J. Comb. Theory, Ser. B, 1994


  Loading...