2024
Eur. J. Comb., February, 2024
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs.
SIAM J. Discret. Math., 2024
On b-greedy colourings and z-colourings.
Discret. Appl. Math., 2024
Diameter of the inversion graph.
CoRR, 2024
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order.
CoRR, 2024
2023
On Finding the Best and Worst Orientations for the Metric Dimension.
Algorithmica, October, 2023
Spanning eulerian subdigraphs in semicomplete digraphs.
J. Graph Theory, 2023
Dichromatic number of chordal graphs.
CoRR, 2023
On the minimum number of inversions to make a digraph k-(arc-)strong.
CoRR, 2023
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023
Semi-proper orientations of dense graphs.
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.
J. Graph Theory, 2022
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2.
J. Graph Theory, 2022
Overlaying a hypergraph with a graph with bounded maximum degree.
Discret. Appl. Math., 2022
On the Nash number and the diminishing Grundy number of a graph.
Discret. Appl. Math., 2022
Problems, proofs, and disproofs on the inversion number.
CoRR, 2022
On the minimum number of arcs in k-dicritical oriented graphs.
CoRR, 2022
On the Dichromatic Number of Surfaces.
Electron. J. Comb., 2022
Grabbing Olives on Linear Pizzas and Pissaladières.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022
2021
On the inversion number of oriented graphs.
Discret. Math. Theor. Comput. Sci., 2021
On the semi-proper orientations of graphs.
Discret. Appl. Math., 2021
Powers of paths in tournaments.
Comb. Probab. Comput., 2021
2020
A variant of the Erdős-Sós conjecture.
J. Graph Theory, 2020
Corrigendum to "Bisimplicial vertices in even-hole-free graphs".
J. Comb. Theory B, 2020
Cooperative Colorings of Trees and of Bipartite Graphs.
Electron. J. Comb., 2020
Inversion number of an oriented graph and related parameters.
Proceedings of the First International Conference "Algebras, graphs and ordered sets", 2020
2019
Bipartite spanning sub(di)graphs induced by 2-partitions.
J. Graph Theory, 2019
On the Unavoidability of Oriented Trees.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Constrained ear decompositions in graphs and digraphs.
Discret. Math. Theor. Comput. Sci., 2019
Backbone colouring and algorithms for TDMA scheduling.
Discret. Math. Theor. Comput. Sci., 2019
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number.
Electron. J. Comb., 2019
2018
Out-degree reducing partitions of digraphs.
Theor. Comput. Sci., 2018
Finding a subdivision of a prescribed digraph of order 4.
J. Graph Theory, 2018
Subdivisions of oriented cycles in digraphs with large chromatic number.
J. Graph Theory, 2018
χ-bounded families of oriented graphs.
J. Graph Theory, 2018
Complexity dichotomies for the MinimumF-Overlay problem.
J. Discrete Algorithms, 2018
Steinberg-like theorems for backbone colouring.
Discret. Appl. Math., 2018
Bispindles in Strongly Connected Digraphs with Large Chromatic Number.
Electron. J. Comb., 2018
On the Minimum Size of an Identifying Code Over All Orientations of a Graph.
Electron. J. Comb., 2018
On the Complexity of Compressing Two Dimensional Routing Tables with Order.
Algorithmica, 2018
Tournaments and Semicomplete Digraphs.
Proceedings of the Classes of Directed Graphs., 2018
2017
Coloring Graphs with Constraints on Connectivity.
J. Graph Theory, 2017
Minimum density of identifying codes of king grids.
Electron. Notes Discret. Math., 2017
Bispindle in strongly connected digraphs with large chromatic number.
Electron. Notes Discret. Math., 2017
Identifying codes for infinite triangular grids with a finite number of rows.
Discret. Math., 2017
Complexity Dichotomies for the Minimum ℱ -Overlay Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017
2016
Finding good 2-partitions of digraphs I. Hereditary properties.
Theor. Comput. Sci., 2016
Finding good 2-partitions of digraphs II. Enumerable properties.
Theor. Comput. Sci., 2016
Proper orientation of cacti.
Theor. Comput. Sci., 2016
Compressing Two-dimensional Routing Tables with Order.
Electron. Notes Discret. Math., 2016
The complexity of finding arc-disjoint branching flows.
Discret. Appl. Math., 2016
Minimum-Density Identifying Codes in Square Grids.
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Design of fault-tolerant on-board networks with variable switch sizes.
Theor. Comput. Sci., 2015
Finding a subdivision of a digraph.
Theor. Comput. Sci., 2015
On the proper orientation number of bipartite graphs.
Theor. Comput. Sci., 2015
Complexity of greedy edge-colouring.
J. Braz. Comput. Soc., 2015
Colouring graphs with constraints on connectivity.
CoRR, 2015
2014
Detection number of bipartite graphs and cubic graphs.
Discret. Math. Theor. Comput. Sci., 2014
List circular backbone colouring.
Discret. Math. Theor. Comput. Sci., 2014
(Circular) backbone colouring: Forest backbones in planar graphs.
Discret. Appl. Math., 2014
2013
Backbone colouring: Tree backbones with small diameter in planar graphs.
Theor. Comput. Sci., 2013
The game Grundy number of graphs.
J. Comb. Optim., 2013
Enumerating the edge-colourings and total colourings of a regular graph.
J. Comb. Optim., 2013
Oriented trees in digraphs.
Discret. Math., 2013
On the Grundy and <i>b</i>-Chromatic Numbers of a Graph.
Algorithmica, 2013
On the (Non-)Existence of Polynomial Kernels for <i>P</i> <sub> <i>l</i> </sub>-Free Edge Modification Problems.
Algorithmica, 2013
2012
Finding an induced subdivision of a digraph.
Theor. Comput. Sci., 2012
Griggs and Yeh's Conjecture and L(p, 1)-labelings.
SIAM J. Discret. Math., 2012
New Bounds on the Grundy Number of Products of Graphs.
J. Graph Theory, 2012
Weighted improper colouring.
J. Discrete Algorithms, 2012
b-coloring of tight graphs.
Discret. Appl. Math., 2012
On spanning galaxies in digraphs.
Discret. Appl. Math., 2012
Good edge-labelling of graphs.
Discret. Appl. Math., 2012
2011
5-Coloring Graphs with 4 Crossings.
SIAM J. Discret. Math., 2011
Acyclic Edge-Coloring of Planar Graphs.
SIAM J. Discret. Math., 2011
Facial non-repetitive edge-coloring of plane graphs.
J. Graph Theory, 2011
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree.
Graphs Comb., 2011
Exact Algorithms for <i>L</i>(2, 1)-Labeling of Graphs.
Algorithmica, 2011
2010
Facial colorings using Hall's Theorem.
Eur. J. Comb., 2010
Improper Coloring of Weighted Grid and Hexagonal Graphs.
Discret. Math. Algorithms Appl., 2010
Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513].
Discret. Math., 2010
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof.
Discret. Math., 2010
Grundy number and products of graphs.
Discret. Math., 2010
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.
Discret. Appl. Math., 2010
WDM and Directed Star Arboricity.
Comb. Probab. Comput., 2010
On the Grundy Number of a Graph.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010
2009
Improper coloring of unit disk graphs.
Networks, 2009
Acyclic edge-colouring of planar graphs. Extended abstract.
Electron. Notes Discret. Math., 2009
Choosability of the square of planar subcubic graphs with large girth.
Discret. Math., 2009
Complexity of (p, 1)-total labelling.
Discret. Appl. Math., 2009
About a Brooks-type theorem for improper colouring.
Australas. J Comb., 2009
2008
3-Facial Coloring of Plane Graphs.
SIAM J. Discret. Math., 2008
Bisimplicial vertices in even-hole-free graphs.
J. Comb. Theory B, 2008
(p, 1)-Total labelling of graphs.
Discret. Math., 2008
Hoàng-Reed conjecture holds for tournaments.
Discret. Math., 2008
L(2, 1)-labelling of graphs.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
2007
Paths with two blocks in n-chromatic digraphs.
J. Comb. Theory B, 2007
List Colouring Squares of Planar Graphs.
Electron. Notes Discret. Math., 2007
2006
Fault tolerant on-board networks with priorities.
Networks, 2006
Repartitors, Selectors and Superselectors.
J. Interconnect. Networks, 2006
Improper choosability of graphs and maximum average degree.
J. Graph Theory, 2006
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.
J. Graph Theory, 2006
3-facial colouring of plane graphs
CoRR, 2006
2005
Improper Colourings of Unit Disk Graphs.
Electron. Notes Discret. Math., 2005
Channel Assignment and Improper Choosability of Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005
2004
Pancyclic arcs and connectivity in tournaments.
J. Graph Theory, 2004
Stable set meeting every longest path.
Discret. Math., 2004
Trees with three leaves are (n+1)-unavoidable.
Discret. Appl. Math., 2004
2003
On Unavoidability of Trees with kLeaves.
Graphs Comb., 2003
2002
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice.
Discret. Math., 2002
Design of Fault Tolerant Satellite Networks with Priorities via Selectors.
Proceedings of the SIROCCO 9, 2002
2001
Trees with three leaves are (n + l)-unavoidable.
Electron. Notes Discret. Math., 2001
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice.
Discret. Math., 2001
2000
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture.
J. Graph Theory, 2000
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.
J. Comb. Theory B, 2000
Oriented Hamiltonian Cycles in Tournaments.
J. Comb. Theory B, 2000
Finding an Oriented Hamiltonian Path in a Tournament.
J. Algorithms, 2000
Electron. Notes Discret. Math., 2000
