|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Diana Piguet, Maya Jakobine Stein |
An approximate version of the Loebl-Komlós-Sós conjecture.  |
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 | Cristina G. Fernandes, Maya Stein |
Stability in geodesics for memoryless binary long-lived consensus. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Stein, José Zamora |
The relative degree and large complete minors in infinite graphs. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Stein |
Extremal infinite graph theory. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Maya Stein |
Geodesic stability for memoryless binary long-lived consensus |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
Complexity of Splits Reconstruction for Low-Degree Trees. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Maya Jakobine Stein |
Duality of Ends. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
Complexity of Splits Reconstruction for Low-Degree Trees |
CoRR |
2010 |
DBLP 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 | Maya Stein |
Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs. |
SIAM J. Discrete Math. |
2010 |
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 | Diana Piguet, Maya Jakobine Stein |
The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Maya Jakobine Stein |
Forcing highly connected subgraphs. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Diana Piguet, Maya Stein |
An approximate version of the Loebl-Komlós-Sós conjecture. |
Electronic Notes in Discrete Mathematics |
2007 |
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, Maya Jakobine Stein |
MacLane's planarity criterion for locally finite graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Maya Jakobine Stein |
Arboricity and tree-packing in locally finite graphs. |
J. Comb. Theory, Ser. B |
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 |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")