Maya Jakobine Stein

Discret. Math., 2025

2024

Dirac-type conditions for spanning bounded-degree hypertrees.

[BibT_eX]

[DOI]

Nicolás Sanhueza-Matamala

J. Comb. Theory B, March, 2024

Kalai's conjecture in r-partite r-graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., March, 2024

Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

Antidirected subgraphs of oriented graphs.

[BibT_eX]

[DOI]

Camila Zárate-Guerén

Comb. Probab. Comput., 2024

2023

Antipaths in oriented graphs.

[BibT_eX]

[DOI]

Tereza Klimosová

Discret. Math., September, 2023

Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Graph Theory, April, 2023

Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result.

[BibT_eX]

[DOI]

Bruce A. Reed

J. Graph Theory, April, 2023

3-Colouring Pt-Free Graphs Without Short Odd Cycles.

[BibT_eX]

[DOI]

Alberto Rojas Anríquez

Algorithmica, April, 2023

Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Clique immersions and independence number.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

2021

Better 3-coloring algorithms: Excluding a triangle and a seven vertex path.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Theor. Comput. Sci., 2021

On the Erdős-Sós conjecture for trees with bounded degree.

[BibT_eX]

[DOI]

Guido Besomi

Comb. Probab. Comput., 2021

Active clustering for labeling training data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020

Maximum and Minimum Degree Conditions for Embedding Trees.

[BibT_eX]

[DOI]

Guido Besomi

SIAM J. Discret. Math., 2020

Regularity inheritance in pseudorandom graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

A variant of the Erdős-Sós conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

3-Colouring Pt-free graphs without short odd cycles.

[BibT_eX]

[DOI]

Alberto Rojas

CoRR, 2020

2019

Degree Conditions for Embedding Trees.

[BibT_eX]

[DOI]

Guido Besomi

SIAM J. Discret. Math., 2019

Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.

[BibT_eX]

[DOI]

Hiêp Hàn

J. Graph Theory, 2019

Large Immersions in Graphs with Independence Number 3 and 4.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Approximately Coloring Graphs Without Long Induced Paths.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Monochromatic tree covers and Ramsey numbers for set-coloured graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices.

[BibT_eX]

[DOI]

Comb., 2018

2017

Almost Partitioning a 3-Edge-Colored Kn, n into Five Monochromatic Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles.

[BibT_eX]

[DOI]

Hiêp Hàn

Electron. Notes Discret. Math., 2017

Clique coloring B1-EPG graphs.

[BibT_eX]

[DOI]

Flavia Bonomo

María Pía Mazzoleni

Discret. Math., 2017

2016

Convex p-partitions of bipartite graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Monochromatic Cycle Partitions in Local Edge Colorings.

[BibT_eX]

[DOI]

David Conlon

J. Graph Theory, 2016

List Edge-Coloring and Total Coloring in Graphs of Low Treewidth.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

2015

Geodesic stability for memoryless binary long-lived consensus.

[BibT_eX]

[DOI]

Cristina G. Fernandes

J. Comput. Syst. Sci., 2015

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Local colourings and monochromatic partitions in complete bipartite graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Complexity of splits reconstruction for low-degree trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.

[BibT_eX]

[DOI]

Algorithmica, 2015

2014

Minimal bricks have many vertices of small degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Cycles Are Strongly Ramsey-Unsaturated.

[BibT_eX]

[DOI]

Jozef Skokan

Comb. Probab. Comput., 2014

Partitioning two-coloured complete multipartite graphs into monochromatic paths.

[BibT_eX]

[DOI]

CoRR, 2014

3-Colouring graphs without triangles or induced paths on seven vertices.

[BibT_eX]

[DOI]

Flavia Bonomo

CoRR, 2014

Connectivity and tree structure in finite graphs.

[BibT_eX]

[DOI]

Comb., 2014

2013

Forcing Large Complete (Topological) Minors in Infinite Graphs.

[BibT_eX]

[DOI]

José Zamora

SIAM J. Discret. Math., 2013

Small degree vertices in minimal bricks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

2012

On claw-free t-perfect graphs.

[BibT_eX]

[DOI]

Math. Program., 2012

An approximate version of the Loebl-Komlós-Sós conjecture.

[BibT_eX]

[DOI]

Diana Piguet

J. Comb. Theory B, 2012

2011

The relative degree and large complete minors in infinite graphs.

[BibT_eX]

[DOI]

José Zamora

Electron. Notes Discret. Math., 2011

Stability in geodesics for memoryless binary long-lived consensus.

[BibT_eX]

[DOI]

Cristina G. Fernandes

Electron. Notes Discret. Math., 2011

Extremal infinite graph theory.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

t-Perfection Is Always Strong for Claw-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Duality of Ends.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

2009

Characterising claw-free t-perfect graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

2008

The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars.

[BibT_eX]

[DOI]

Diana Piguet

Electron. J. Comb., 2008

2007

Forcing highly connected subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2007

On end degrees and infinite cycles in locally finite graphs.

[BibT_eX]

[DOI]

Comb., 2007

2006

Arboricity and tree-packing in locally finite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

MacLane's planarity criterion for locally finite graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2006

2005

Menger's theorem for infinite graphs with ends.

[BibT_eX]

[DOI]

Reinhard Diestel

J. Graph Theory, 2005

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs.

[BibT_eX]

[DOI]

Reinhard Diestel