|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Henning Bruhn, Akira Saito |
Clique or hole in claw-free graphs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Maya Stein |
On claw-free t-perfect graphs. |
Math. Program. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel |
Twins of rayless graphs. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel |
Infinite matroids in graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Berger, Henning Bruhn |
Eulerian edge sets in locally finite graphs. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Maya Jakobine Stein |
Duality of Ends. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel |
Every rayless graph has an unfriendly partition. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Maya Stein |
t-Perfection Is Always Strong for Claw-Free Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel |
MacLane's theorem for arbitrary surfaces. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel |
Every rayless graph has an unfriendly partition. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Stein, Henning Bruhn |
Characterising claw-free t-perfect graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Stefanie Kosuch, Melanie Win Myint |
Bicycles and left-right tours in locally finite graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn |
Periodical states and marching groups in a closed owari. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jiri Sgall |
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Attila Bernáth, Henning Bruhn |
Degree Constrained Orientations in Countable Graphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Henning Bruhn, Xingxing Yu |
Hamilton Cycles in Planar Locally Finite Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Maya Stein |
On end degrees and infinite cycles in locally finite graphs. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman |
Single source multiroute flows and cuts on uniform capacity networks. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Maya Jakobine Stein |
MacLane's planarity criterion for locally finite graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel |
Duality in Infinite Graphs. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Maya Stein |
Menger's theorem for infinite graphs with ends. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Reinhard Diestel, Maya Stein |
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn |
The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")