Carl Feghali

Comb., August, 2024

Dirac's theorem on chordal graphs implies Brooks' theorem.

[BibT_eX]

[DOI]

Discret. Math., March, 2024

Solution to a problem of Katona on counting cliques of weighted graphs.

[BibT_eX]

[DOI]

Rémi Pellerin

Discret. Appl. Math., March, 2024

1-Extendability of Independent Sets.

[BibT_eX]

[DOI]

Algorithmica, March, 2024

Decomposing a triangle-free planar graph into a forest and a subcubic forest.

[BibT_eX]

[DOI]

Robert Sámal

Eur. J. Comb., February, 2024

Three remarks on W graphs.

[BibT_eX]

[DOI]

Malory Marin

Theor. Comput. Sci., 2024

Another Proof of Euler's Circuit Theorem.

[BibT_eX]

[DOI]

Am. Math. Mon., 2024

Kempe classes and almost bipartite graphs.

[BibT_eX]

[DOI]

Daniel W. Cranston

Discret. Appl. Math., 2024

Beyond recognizing well-covered graphs.

[BibT_eX]

[DOI]

Malory Marin

Rémi Watrigant

CoRR, 2024

Graphs without a 3-connected subgraph are 4-colorable.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Partitioning into degenerate graphs in linear time.

[BibT_eX]

[DOI]

Eur. J. Comb., December, 2023

Strengthening a Theorem of Meyniel.

[BibT_eX]

[DOI]

Quentin Deschamps

Frantisek Kardos

Clément Legrand-Duchesne

Théo Pierron

SIAM J. Discret. Math., June, 2023

Kempe equivalence of 4-critical planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, May, 2023

Recoloring Planar Graphs of Girth at Least Five.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2023

A note on matching-cut in Pt-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2023

Three remarks on W2 graphs.

[BibT_eX]

[DOI]

Malory Marin

CoRR, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

A short proof of Talbot's theorem for intersecting separated sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

Mixing colourings in 2K2-free graphs.

[BibT_eX]

[DOI]

Owen D. Merkel

Discret. Math., 2022

The maximum sum of sizes of cross-intersecting families of subsets of a set.

[BibT_eX]

[DOI]

Discret. Math., 2022

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Reconfiguring colorings of graphs with bounded maximum average degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

A Thomassen-type method for planar graph recoloring.

[BibT_eX]

[DOI]

Zdenek Dvorák

Eur. J. Comb., 2021

A note on Matching-Cut in Pt-free Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Mixing colourings in 2K2-free graphs.

[BibT_eX]

[DOI]

Owen D. Merkel

CoRR, 2021

2020

Toward Cereceda's conjecture for planar graphs.

[BibT_eX]

[DOI]

Eduard Eiben

J. Graph Theory, 2020

Reconfiguring 10-Colourings of Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Partitioning a graph into degenerate subgraphs.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Pinar Heggernes

Eur. J. Comb., 2020

An Erdős-Ko-Rado theorem for unions of length 2 paths.

[BibT_eX]

[DOI]

Glenn Hurlbert

Vikram Kamat

Discret. Math., 2020

Reconfiguration graph for vertex colourings of weakly chordal graphs.

[BibT_eX]

[DOI]

Jirí Fiala

Discret. Math., 2020

An Update on Reconfiguring $10$-Colorings of Planar Graphs.

[BibT_eX]

[DOI]

Zdenek Dvorák

Electron. J. Comb., 2020

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

[BibT_eX]

[DOI]

Algorithmica, 2020

Intersecting families, signed sets, and injection.

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

On a conjecture of Mohar concerning Kempe equivalence of regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Paths between colourings of graphs with bounded tree-width.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Paths between colourings of sparse graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations.

[BibT_eX]

[DOI]

John Asplund

Pierre Charbit

Discret. Math., 2019

Reconfiguring colourings of graphs with bounded maximum average degree.

[BibT_eX]

[DOI]

CoRR, 2019

Independent Feedback Vertex Set for P5-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Cyclability in Graph Classes.

[BibT_eX]

[DOI]

Christophe Crespelle

Petr A. Golovach

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018

Independent feedback vertex sets for graphs of bounded diameter.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Erdős-Ko-Rado theorems for a family of trees.

[BibT_eX]

[DOI]

Daniel Thomas

Discret. Appl. Math., 2018

Towards Cereceda's conjecture for planar graphs.

[BibT_eX]

[DOI]

Eduard Eiben

CoRR, 2018

2017

Recognizing Graphs Close to Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

A Reconfigurations Analogue of Brooks' Theorem and Its Consequences.

[BibT_eX]

[DOI]

Daniël Paulusma

J. Graph Theory, 2016

2015

Kempe Equivalence of Colourings of Cubic Graphs.

[BibT_eX]

[DOI]

Daniël Paulusma

Electron. Notes Discret. Math., 2015

Partitioning a graph into disjoint cliques and a triangle-free graph.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Haiko Müller

Discret. Appl. Math., 2015

2014

Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs.

[BibT_eX]

[DOI]

Faisal N. Abu-Khzam

Haiko Müller

CoRR, 2014

A Reconfigurations Analogue of Brooks' Theorem.

[BibT_eX]

[DOI]