Stephan Brandt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2014

The Total Irregularity of a GraphHosam Abdo, Stephan Brandt, Darko Dimitrov. dmtcs, 16(1):201-206, 2014. [doi]

The circumference of the square of a connected graphStephan Brandt, Janina Müttel, Dieter Rautenbach. combinatorica, 34(5):547-559, 2014. [doi]

On degree sums of a triangle-free graphStephan Brandt, Jochen Harant, Steffi Naumann. DM, 337:76-82, 2014. [doi]

2013

Cycles and Paths in Triangle-Free GraphsStephan Brandt. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 81-93, Springer, 2013. [doi]

Ramsey Results for Cycle SpectraStephan Brandt, Felix Joos, Janina Müttel, Dieter Rautenbach. jgt, 74(2):210-215, 2013. [doi]

Cycles in squares of trees without generalized clawsStephan Brandt, Janina Müttel, Dieter Rautenbach. DM, 313(19):1989-1999, 2013. [doi]

2010

Triangle-free graphs whose independence number equals the degreeStephan Brandt. DM, 310(3):662-669, 2010. [doi]

A note on generalized pentagonsStephan Brandt. DM, 310(20):2766-2767, 2010. [doi]

Edge colouring by total labellingsStephan Brandt, Kristína Budajová, Dieter Rautenbach, Michael Stiebitz. DM, 310(2):199-205, 2010. [doi]

Edge-Injective and Edge-Surjective Vertex LabellingsStephan Brandt, Jozef Miskuf, Dieter Rautenbach, Friedrich Regen, Imre Z. Ruzsa. siamdm, 24(2):666-683, 2010. [doi]

Minimum degree and density of binary sequencesStephan Brandt, Janina Müttel, Dieter Rautenbach, Friedrich Regen. ejc, 31(7):1936-1945, 2010. [doi]

2009

Graphs of odd girth 7 with large degreeStephan Brandt, Elizabeth Ribe-Baumann. endm, 34:89-93, 2009. [doi]

Edge irregular total labellings for graphs of linear sizeStephan Brandt, Jozef Miskuf, Dieter Rautenbach. DM, 309(12):3786-3792, 2009. [doi]

2008

On a conjecture about edge irregular total labelingsStephan Brandt, Jozef Miskuf, Dieter Rautenbach. jgt, 57(4):333-343, 2008. [doi]

2006

Global Connectivity And Expansion: Long Cycles and Factors In ::::f::::-Connected GraphsStephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell. combinatorica, 26(1):17-36, 2006. [doi]

2004

Subgraphs in vertex neighborhoods of ::::K::r::::::-free graphsJørgen Bang-Jensen, Stephan Brandt. jgt, 47(1):29-38, 2004. [doi]

On Cyclic Packing of a TreeStephan Brandt, Mariusz Wozniak. gc, 20(4):435-442, 2004. [doi]

2003

NoteStephan Brandt. combinatorica, 23(4):693-696, 2003. [doi]

2002

A 4-colour problem for dense triangle-free graphsStephan Brandt. DM, 251(1-3):33-46, 2002. [doi]

Triangle-free graphs and forbidden subgraphsStephan Brandt. DAM, 120(1-3):25-33, 2002.

2000

The Generation of Maximal Triangle-Free GraphsStephan Brandt, Gunnar Brinkmann, Thomas Harmuth. gc, 16(2):149-157, 2000. [doi]

Closure and stable Hamiltonian properties in claw-free graphsStephan Brandt, Odile Favaron, Zdenek Ryjácek. jgt, 34(1):30-41, 2000. [doi]

1999

9-Connected Claw-Free Graphs Are Hamilton-ConnectedStephan Brandt. JCT, 75(2):167-173, 1999. [doi]

1998

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

The local density of triangle-free graphsStephan Brandt. DM, 183(1-3):17-25, 1998. [doi]

All Ramsey Numbers r(K_3, G) For Connected Graphs of Order 9Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth. combinatorics, 5, 1998. [doi]

Another Infinite Sequence of Dense Triangle-Free GraphsStephan Brandt, Tomaz Pisanski. combinatorics, 5, 1998. [doi]

Weakly pancyclic graphsStephan Brandt, Ralph J. Faudree, Wayne Goddard. jgt, 27(3):141-176, 1998. [doi]

1997

Computing the Independence Number of Dense Triangle-Free GraphsStephan Brandt. criwg 1997: 100-108

A Sufficient Condition for All Short CyclesStephan Brandt. DAM, 79(1-3):63-66, 1997. [doi]

Degree conditions for 2-factorsStephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak. jgt, 24(2):165-173, 1997. [doi]

1996

The Erdős-Sós conjecture for graphs of girth 5Stephan Brandt, Edward Dobson. DM, 150(1-3):411-414, 1996. [doi]

1995

An Extremal Result for Subgraphs with Few EdgesStephan Brandt. JCT, 64(2):288-299, 1995. [doi]

An extremal problem for cycles in hamiltonian graphsGeorge R. T. Hendry, Stephan Brandt. gc, 11(3):255-262, 1995. [doi]

1994

Subtrees and Subforests of GraphsStephan Brandt. JCT, 61(1):63-70, 1994. [doi]

Sign in or sign up to see more results.

runs on WebDSL