The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephan Brandt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephan Brandt
    Computing the Independence Number of Dense Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:100-108 [Conf]
  2. Stephan Brandt
    Note. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:4, pp:693-696 [Journal]
  3. Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
    Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:17-36 [Journal]
  4. Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth
    All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  5. Stephan Brandt, Tomaz Pisanski
    Another Infinite Sequence of Dense Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  6. Stephan Brandt
    Triangle-free graphs and forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:25-33 [Journal]
  7. Stephan Brandt
    A Sufficient Condition for All Short Cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:63-66 [Journal]
  8. Stephan Brandt
    A 4-colour problem for dense triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:33-46 [Journal]
  9. Stephan Brandt, Mariusz Wozniak
    On Cyclic Packing of a Tree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:435-442 [Journal]
  10. Stephan Brandt
    Subtrees and Subforests of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:63-70 [Journal]
  11. Stephan Brandt
    An Extremal Result for Subgraphs with Few Edges. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:288-299 [Journal]
  12. Stephan Brandt
    9-Connected Claw-Free Graphs Are Hamilton-Connected. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:2, pp:167-173 [Journal]
  13. Jørgen Bang-Jensen, Stephan Brandt
    Subgraphs in vertex neighborhoods of Kr-free graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:1, pp:29-38 [Journal]
  14. Denise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz
    Neighborhood conditions for balanced independent sets in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:181, n:1-3, pp:31-36 [Journal]
  15. Stephan Brandt
    The local density of triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:17-25 [Journal]

  16. Edge irregular total labellings for graphs of linear size. [Citation Graph (, )][DBLP]


  17. Edge colouring by total labellings. [Citation Graph (, )][DBLP]


  18. Triangle-free graphs whose independence number equals the degree. [Citation Graph (, )][DBLP]


  19. A note on generalized pentagons. [Citation Graph (, )][DBLP]


  20. Minimum degree and density of binary sequences. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002