Frédéric Havet

Graphs Comb., August, 2025

New lower bounds on the cutwidth of graphs.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2025

The 3-Dicritical Semi-Complete Digraphs.

[BibT_eX]

[DOI]

Florian Hörsch

Electron. J. Comb., 2025

Problems, Proofs, and Disproofs on the Inversion Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Minimum Acyclic Number and Maximum Dichromatic Number of Oriented Triangle-Free Graphs of a Given Order.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Digraph redicolouring.

[BibT_eX]

[DOI]

Nicolas Bousquet

Nicolas Nisse

Jonas Costa Ferreira da Silva

Amadeus Reinald

Eur. J. Comb., February, 2024

On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

On b-greedy colourings and z-colourings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Diameter of the inversion graph.

[BibT_eX]

[DOI]

Florian Hörsch

Clément Rambaud

CoRR, 2024

2023

On Finding the Best and Worst Orientations for the Metric Dimension.

[BibT_eX]

[DOI]

Algorithmica, October, 2023

Spanning eulerian subdigraphs in semicomplete digraphs.

[BibT_eX]

[DOI]

Anders Yeo

J. Graph Theory, 2023

On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.

[BibT_eX]

[DOI]

Clément Rambaud

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Semi-proper orientations of dense graphs.

[BibT_eX]

[DOI]

Nicolas Nisse

Karol Suchan

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

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

[BibT_eX]

[DOI]

J. Graph Theory, 2022

On the Nash number and the diminishing Grundy number of a graph.

[BibT_eX]

[DOI]

Allen Ibiapina

Leonardo S. Rocha

Discret. Appl. Math., 2022

Problems, proofs, and disproofs on the inversion number.

[BibT_eX]

[DOI]

CoRR, 2022

On the minimum number of arcs in k-dicritical oriented graphs.

[BibT_eX]

[DOI]

CoRR, 2022

On the Dichromatic Number of Surfaces.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Grabbing Olives on Linear Pizzas and Pissaladières.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Michel Cosnard

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

On the inversion number of oriented graphs.

[BibT_eX]

[DOI]

Jonas Costa Ferreira da Silva

Discret. Math. Theor. Comput. Sci., 2021

On the semi-proper orientations of graphs.

[BibT_eX]

[DOI]

Ali Dehghan

Discret. Appl. Math., 2021

Powers of paths in tournaments.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

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

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Corrigendum to "Bisimplicial vertices in even-hole-free graphs".

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Cooperative Colorings of Trees and of Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Overlaying a Hypergraph with a Graph with Bounded Maximum Degree.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

Inversion number of an oriented graph and related parameters.

[BibT_eX]

[DOI]

Jonas Costa Ferreira da Silva

Proceedings of the First International Conference "Algebras, graphs and ordered sets", 2020

2019

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

[BibT_eX]

[DOI]

J. Graph Theory, 2019

On the Unavoidability of Oriented Trees.

[BibT_eX]

[DOI]

François Dross

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

Constrained ear decompositions in graphs and digraphs.

[BibT_eX]

[DOI]

Nicolas Nisse

Discret. Math. Theor. Comput. Sci., 2019

Backbone colouring and algorithms for TDMA scheduling.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

Out-degree reducing partitions of digraphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Finding a subdivision of a prescribed digraph of order 4.

[BibT_eX]

[DOI]

Ana Karolinna Maia

Bojan Mohar

J. Graph Theory, 2018

Subdivisions of oriented cycles in digraphs with large chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

χ-bounded families of oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Complexity dichotomies for the MinimumF-Overlay problem.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Bispindles in Strongly Connected Digraphs with Large Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

On the Minimum Size of an Identifying Code Over All Orientations of a Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

On the Complexity of Compressing Two Dimensional Routing Tables with Order.

[BibT_eX]

[DOI]

Frédéric Giroire

Joanna Moulierac

Algorithmica, 2018

Tournaments and Semicomplete Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Classes of Directed Graphs., 2018

2017

Coloring Graphs with Constraints on Connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Minimum density of identifying codes of king grids.

[BibT_eX]

[DOI]

Rennan Dantas

Rudini M. Sampaio

Electron. Notes Discret. Math., 2017

Bispindle in strongly connected digraphs with large chromatic number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Identifying codes for infinite triangular grids with a finite number of rows.

[BibT_eX]

[DOI]

Rennan Dantas

Rudini M. Sampaio

Discret. Math., 2017

Complexity Dichotomies for the Minimum ℱ -Overlay Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016

Finding good 2-partitions of digraphs I. Hereditary properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Finding good 2-partitions of digraphs II. Enumerable properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Proper orientation of cacti.

[BibT_eX]

[DOI]

Ana Silva

Theor. Comput. Sci., 2016

Compressing Two-dimensional Routing Tables with Order.

[BibT_eX]

[DOI]

Frédéric Giroire

Joanna Moulierac

Electron. Notes Discret. Math., 2016

The complexity of finding arc-disjoint branching flows.

[BibT_eX]

[DOI]

Anders Yeo

Discret. Appl. Math., 2016

Minimum-Density Identifying Codes in Square Grids.

[BibT_eX]

[DOI]

Marwane Bouznif

Myriam Preissmann

Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015

Design of fault-tolerant on-board networks with variable switch sizes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Finding a subdivision of a digraph.

[BibT_eX]

[DOI]

Ana Karolinna Maia

Theor. Comput. Sci., 2015

On the proper orientation number of bipartite graphs.

[BibT_eX]

[DOI]

Susanna F. de Rezende

Phablo F. S. Moura

Theor. Comput. Sci., 2015

Complexity of greedy edge-colouring.

[BibT_eX]

[DOI]

Ana Karolinna Maia

Min-Li Yu

J. Braz. Comput. Soc., 2015

Steinberg-like theorems for backbone colouring.

[BibT_eX]

[DOI]

Mathieu Schmitt

Electron. Notes Discret. Math., 2015

Colouring graphs with constraints on connectivity.

[BibT_eX]

[DOI]

CoRR, 2015

2014

Detection number of bipartite graphs and cubic graphs.

[BibT_eX]

[DOI]

Nagarajan Paramaguru

Rathinasamy Sampathkumar

Discret. Math. Theor. Comput. Sci., 2014

List circular backbone colouring.

[BibT_eX]

[DOI]

Andrew D. King

Discret. Math. Theor. Comput. Sci., 2014

(Circular) backbone colouring: Forest backbones in planar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Backbone colouring: Tree backbones with small diameter in planar graphs.

[BibT_eX]

[DOI]

Victor A. Campos

Rudini Menezes Sampaio

Ana Silva

Theor. Comput. Sci., 2013

The game Grundy number of graphs.

[BibT_eX]

[DOI]

Xuding Zhu

J. Comb. Optim., 2013

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

[BibT_eX]

[DOI]

Stéphane Bessy

J. Comb. Optim., 2013

Oriented trees in digraphs.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Bruce A. Reed

Discret. Math., 2013

On the Grundy and b-Chromatic Numbers of a Graph.

[BibT_eX]

[DOI]

Leonardo Sampaio Rocha

Algorithmica, 2013

On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

Griggs and Yeh's Conjecture and L(p, 1)-labelings.

[BibT_eX]

[DOI]

Bruce A. Reed

SIAM J. Discret. Math., 2012

New Bounds on the Grundy Number of Products of Graphs.

[BibT_eX]

[DOI]

Victor A. Campos

András Gyárfás

Frédéric Maffray

J. Graph Theory, 2012

b-coloring of tight graphs.

[BibT_eX]

[DOI]

Leonardo Sampaio Rocha

Discret. Appl. Math., 2012

2011

5-Coloring Graphs with 4 Crossings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Acyclic Edge-Coloring of Planar Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Facial non-repetitive edge-coloring of plane graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Finding an induced subdivision of a digraph.

[BibT_eX]

[DOI]

Nicolas Trotignon

Electron. Notes Discret. Math., 2011

Exact Algorithms for L(2, 1)-Labeling of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2011

Weighted Improper Colouring.

[BibT_eX]

[DOI]

Remigiusz Modrzejewski

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

Facial colorings using Hall's Theorem.

[BibT_eX]

[DOI]

Daniel Král'

Riste Skrekovski

Eur. J. Comb., 2010

Improper Coloring of Weighted Grid and Hexagonal Graphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Florian Huc

Discret. Math. Algorithms Appl., 2010

Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513].

[BibT_eX]

[DOI]

Min-Li Yu

Discret. Math., 2010

Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.

[BibT_eX]

[DOI]

Discret. Math., 2010

Grundy number and products of graphs.

[BibT_eX]

[DOI]

Marie Asté

Discret. Math., 2010

k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.

[BibT_eX]

[DOI]

Nicole Eggemann

Steven D. Noble

Discret. Appl. Math., 2010

WDM and Directed Star Arboricity.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

On the Grundy Number of a Graph.

[BibT_eX]

[DOI]

Leonardo Sampaio Rocha

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2009

Improper coloring of unit disk graphs.

[BibT_eX]

[DOI]

Ross J. Kang

Networks, 2009

Circular choosability.

[BibT_eX]

[DOI]

Ross J. Kang

Tobias Müller

J. Graph Theory, 2009

Spanning galaxies in digraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Acyclic edge-colouring of planar graphs. Extended abstract.

[BibT_eX]

[DOI]

Tobias Müller

Electron. Notes Discret. Math., 2009

Good edge-labelling of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Choosability of the square of planar subcubic graphs with large girth.

[BibT_eX]

[DOI]

Discret. Math., 2009

Complexity of (p, 1)-total labelling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

About a Brooks-type theorem for improper colouring.

[BibT_eX]

[DOI]

Ricardo C. Corrêa

Australas. J Comb., 2009

2008

3-Facial Coloring of Plane Graphs.

[BibT_eX]

[DOI]

Riste Skrekovski

SIAM J. Discret. Math., 2008

Bisimplicial vertices in even-hole-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

(p, 1)-Total labelling of graphs.

[BibT_eX]

[DOI]

Min-Li Yu

Discret. Math., 2008

Hoàng-Reed conjecture holds for tournaments.

[BibT_eX]

[DOI]

Anders Yeo

Discret. Math., 2008

L(2, 1)-labelling of graphs.

[BibT_eX]

[DOI]

Bruce A. Reed

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Paths with two blocks in n-chromatic digraphs.

[BibT_eX]

[DOI]

Louigi Addario-Berry

J. Comb. Theory B, 2007

List Colouring Squares of Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

2006

Fault tolerant on-board networks with priorities.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Csaba D. Tóth

Networks, 2006

Repartitors, Selectors and Superselectors.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2006

Improper choosability of graphs and maximum average degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

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

[BibT_eX]

[DOI]

Stéphane Bessy

Etienne Birmelé

J. Graph Theory, 2006

3-facial colouring of plane graphs

[BibT_eX]

[DOI]

Riste Skrekovski

CoRR, 2006

2005

Improper Colourings of Unit Disk Graphs.

[BibT_eX]

[DOI]

Ross J. Kang

Electron. Notes Discret. Math., 2005

Channel Assignment and Improper Choosability of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004

Pancyclic arcs and connectivity in tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Stable set meeting every longest path.

[BibT_eX]

[DOI]

Discret. Math., 2004

Trees with three leaves are (n+1)-unavoidable.

[BibT_eX]

[DOI]

Stéphan Ceroi

Discret. Appl. Math., 2004

2003

On Unavoidability of Trees with kLeaves.

[BibT_eX]

[DOI]

Graphs Comb., 2003

2002

Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.

[BibT_eX]

[DOI]

Janez Zerovnik

Discret. Math., 2002

Design of Fault Tolerant Satellite Networks with Priorities via Selectors.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

2001

Trees with three leaves are (n + l)-unavoidable.

[BibT_eX]

[DOI]

Stéphan Ceroi

Electron. Notes Discret. Math., 2001

Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.

[BibT_eX]

[DOI]

Discret. Math., 2001

The push tree problem.

[BibT_eX]

[DOI]

Marc Wennink

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Oriented Hamiltonian Cycles in Tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2000

Finding an Oriented Hamiltonian Path in a Tournament.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Trees in tournaments.

[BibT_eX]

[DOI]