default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephan Brandt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j33]Stephan Brandt, Janina Müttel, Dieter Rautenbach:
The circumference of the square of a connected graph. Comb. 34(5): 547-559 (2014)- [j32]Stephan Brandt, Jochen Harant, Steffi Naumann:
On degree sums of a triangle-free graph. Discret. Math. 337: 76-82 (2014) - [j31]Hosam Abdo, Stephan Brandt, Darko Dimitrov:
The Total Irregularity of a Graph. Discret. Math. Theor. Comput. Sci. 16(1): 201-206 (2014) - 2013
- [j30]Stephan Brandt, Janina Müttel, Dieter Rautenbach:
Cycles in squares of trees without generalized claws. Discret. Math. 313(19): 1989-1999 (2013) - [j29]Stephan Brandt, Felix Joos, Janina Müttel, Dieter Rautenbach:
Ramsey Results for Cycle Spectra. J. Graph Theory 74(2): 210-215 (2013) - [p1]Stephan Brandt:
Cycles and Paths in Triangle-Free Graphs. The Mathematics of Paul Erdős II 2013: 81-93 - 2010
- [j28]Stephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz:
Edge colouring by total labellings. Discret. Math. 310(2): 199-205 (2010) - [j27]Stephan Brandt:
Triangle-free graphs whose independence number equals the degree. Discret. Math. 310(3): 662-669 (2010) - [j26]Stephan Brandt:
A note on generalized pentagons. Discret. Math. 310(20): 2766-2767 (2010) - [j25]Stephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen:
Minimum degree and density of binary sequences. Eur. J. Comb. 31(7): 1936-1945 (2010) - [j24]Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa:
Edge-Injective and Edge-Surjective Vertex Labellings. SIAM J. Discret. Math. 24(2): 666-683 (2010)
2000 – 2009
- 2009
- [j23]Stephan Brandt, Jozef Miskuf, Dieter Rautenbach:
Edge irregular total labellings for graphs of linear size. Discret. Math. 309(12): 3786-3792 (2009) - [j22]Stephan Brandt, Elizabeth Ribe-Baumann:
Graphs of odd girth 7 with large degree. Electron. Notes Discret. Math. 34: 89-93 (2009) - 2008
- [j21]Stephan Brandt, Jozef Miskuf, Dieter Rautenbach:
On a conjecture about edge irregular total labelings. J. Graph Theory 57(4): 333-343 (2008) - 2006
- [j20]Stephan Brandt, Hajo Broersma
, Reinhard Diestel, Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Comb. 26(1): 17-36 (2006) - 2004
- [j19]Stephan Brandt, Mariusz Wozniak:
On Cyclic Packing of a Tree. Graphs Comb. 20(4): 435-442 (2004) - [j18]Jørgen Bang-Jensen, Stephan Brandt:
Subgraphs in vertex neighborhoods of Kr-free graphs. J. Graph Theory 47(1): 29-38 (2004) - 2003
- [j17]Stephan Brandt:
Note. Comb. 23(4): 693-696 (2003) - 2002
- [j16]Stephan Brandt:
Triangle-free graphs and forbidden subgraphs. Discret. Appl. Math. 120(1-3): 25-33 (2002) - [j15]Stephan Brandt:
A 4-colour problem for dense triangle-free graphs. Discret. Math. 251(1-3): 33-46 (2002) - 2000
- [j14]Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth:
The Generation of Maximal Triangle-Free Graphs. Graphs Comb. 16(2): 149-157 (2000) - [j13]Stephan Brandt, Odile Favaron, Zdenek Ryjácek:
Closure and stable Hamiltonian properties in claw-free graphs. J. Graph Theory 34(1): 30-41 (2000)
1990 – 1999
- 1999
- [j12]Stephan Brandt:
9-Connected Claw-Free Graphs Are Hamilton-Connected. J. Comb. Theory B 75(2): 167-173 (1999) - 1998
- [j11]Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth:
All Ramsey Numbers $r(K_3, G)$ For Connected Graphs of Order 9. Electron. J. Comb. 5 (1998) - [j10]Stephan Brandt, Tomaz Pisanski:
Another Infinite Sequence of Dense Triangle-Free Graphs. Electron. J. Comb. 5 (1998) - [j9]Denise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz:
Neighborhood conditions for balanced independent sets in bipartite graphs. Discret. Math. 181(1-3): 31-36 (1998) - [j8]Stephan Brandt:
The local density of triangle-free graphs. Discret. Math. 183(1-3): 17-25 (1998) - [j7]Stephan Brandt, Ralph J. Faudree, Wayne Goddard:
Weakly pancyclic graphs. J. Graph Theory 27(3): 141-176 (1998) - 1997
- [j6]Stephan Brandt:
A Sufficient Condition for All Short Cycles. Discret. Appl. Math. 79(1-3): 63-66 (1997) - [j5]Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - [c1]Stephan Brandt:
Computing the Independence Number of Dense Triangle-Free Graphs. WG 1997: 100-108 - 1996
- [j4]Stephan Brandt, Edward Dobson:
The Erdős-Sós conjecture for graphs of girth 5. Discret. Math. 150(1-3): 411-414 (1996) - 1995
- [j3]George R. T. Hendry, Stephan Brandt:
An extremal problem for cycles in hamiltonian graphs. Graphs Comb. 11(3): 255-262 (1995) - [j2]Stephan Brandt:
An Extremal Result for Subgraphs with Few Edges. J. Comb. Theory B 64(2): 288-299 (1995) - 1994
- [j1]Stephan Brandt:
Subtrees and Subforests of Graphs. J. Comb. Theory B 61(1): 63-70 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
