Stéphane Bessy

Theor. Comput. Sci., 2024

FPT algorithms for packing k-safe spanning rooted sub(di)graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture.

[BibT_eX]

[DOI]

Daniel Gonçalves

Amadeus Reinald

CoRR, 2024

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees.

[BibT_eX]

[DOI]

Laurent Viennot

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Complementary cycles of any length in regular bipartite tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, June, 2023

Dichromatic number of chordal graphs.

[BibT_eX]

[DOI]

Frédéric Havet

CoRR, 2023

Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs.

[BibT_eX]

[DOI]

Johannes Pardey

Electron. J. Comb., 2023

Kernelization for Graph Packing Problems via Rainbow Matching.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Sebastian Wiederrecht

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Complexity of some arc-partition problems for digraphs.

[BibT_eX]

[DOI]

Daniel Gonçalves

Theor. Comput. Sci., 2022

Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2.

[BibT_eX]

[DOI]

Anders Yeo

Graphs Comb., 2022

Algorithmic aspects of broadcast independence.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound.

[BibT_eX]

[DOI]

Johannes Pardey

Electron. J. Comb., 2022

2021

Good orientations of unions of edge-disjoint spanning trees.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Exponential independence in subcubic graphs.

[BibT_eX]

[DOI]

Johannes Pardey

Discret. Math., 2021

Packing Arc-Disjoint Cycles in Tournaments.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Out-colourings of digraphs.

[BibT_eX]

[DOI]

Noga Alon

J. Graph Theory, 2020

The structure of graphs with given number of blocks and the maximum Wiener index.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

On independent set in B1-EPG graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Non-separating spanning trees and out-branchings in digraphsof independence number 2.

[BibT_eX]

[DOI]

Anders Yeo

CoRR, 2020

Maximal Wiener index for graphs with prescribed number of blocks.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

2019

Degree-constrained 2-partitions of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Parameterized complexity of a coupled-task scheduling problem.

[BibT_eX]

[DOI]

Rodolphe Giroudeau

J. Sched., 2019

On the Kőnig?Egerváry theorem for k?paths.

[BibT_eX]

[DOI]

Pascal Ochem

J. Graph Theory, 2019

Bipartite spanning sub(di)graphs induced by 2-partitions.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Relating broadcast independence and independence.

[BibT_eX]

[DOI]

Discret. Math., 2019

Dynamic monopolies for interval graphs with bounded thresholds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.

[BibT_eX]

[DOI]

Alan Diêgo A. Carneiro

Fábio Protti

Uéverton S. Souza

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Out-degree reducing partitions of digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Bounds on the burning number.

[BibT_eX]

[DOI]

Anthony Bonato

Jeannette C. M. Janssen

Elham Roshanbin

Discret. Appl. Math., 2018

(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Antistrong digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Extremal Values of the Chromatic Number for a Given Degree Sequence.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

The Geodetic Hull Number is Hard for Chordal Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Bounds on the exponential domination number.

[BibT_eX]

[DOI]

Pascal Ochem

Discret. Math., 2017

Colorful paths for 3-chromatic graphs.

[BibT_eX]

[DOI]

Nicolas Bousquet

Discret. Math., 2017

Burning a graph is hard.

[BibT_eX]

[DOI]

Anthony Bonato

Jeannette C. M. Janssen

Elham Roshanbin

Discret. Appl. Math., 2017

Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Exponential Domination in Subcubic Graphs.

[BibT_eX]

[DOI]

Pascal Ochem

Electron. J. Comb., 2016

2015

Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Two-floor buildings need eight colors.

[BibT_eX]

[DOI]

Daniel Gonçalves

Jean-Sébastien Sereni

J. Graph Algorithms Appl., 2015

On Independent Set on B1-EPG Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

(Arc-)disjoint flows in networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

2013

Enumerating the edge-colourings and total colourings of a regular graph.

[BibT_eX]

[DOI]

Frédéric Havet

J. Comb. Optim., 2013

Polynomial kernels for Proper Interval Completion and related problems.

[BibT_eX]

[DOI]

Anthony Perez

Inf. Comput., 2013

2012

Some problems in graph theory and graphs algorithmic theory.

[BibT_eX]

[DOI]

, 2012

2011

Kernels for feedback arc set in tournaments.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

2010

Optical index of fault tolerant routings in WDM networks.

[BibT_eX]

[DOI]

Clément Lepelletier

Networks, 2010

Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree.

[BibT_eX]

[DOI]

Nicolas Lichiardopol

Jean-Sébastien Sereni

Discret. Math., 2010

Polynomial kernels for 3-leaf power graph modification problems.

[BibT_eX]

[DOI]

Christophe Paul

Anthony Perez

Discret. Appl. Math., 2010

2008

Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdös condition approach.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Two proofs of Bermond-Thomassen conjecture for regular tournaments.

[BibT_eX]

[DOI]

Nicolas Lichiardopol

Jean-Sébastien Sereni

Electron. Notes Discret. Math., 2007

Spanning a strong digraph by <i>alpha</i> circuits: A proof of Gallai's conjecture.

[BibT_eX]

[DOI]

Comb., 2007

2006

Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.

[BibT_eX]

[DOI]

Frédéric Havet

Etienne Birmelé

J. Graph Theory, 2006

2005

The categorical product of two 5-chromatic digraphs can be 3-chromatic.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Every strong digraph has a spanning strong subgraph with at most <i>n</i>+2 alpha-2 arcs.

[BibT_eX]

[DOI]