| Publication | Date of Publication | Type |
|---|
On the minimum number of arcs in 4-dicritical oriented graphs
Journal of Graph Theory | 2025-01-06 | Paper |
On \(b\)-greedy colourings and \(z\)-colourings
Discrete Applied Mathematics | 2024-11-06 | Paper |
On the dichromatic number of surfaces
| 2024-09-13 | Paper |
On the minimum number of arcs in \(k\)-dicritical oriented graphs
SIAM Journal on Discrete Mathematics | 2024-06-25 | Paper |
Grabbing olives on linear pizzas and pissaladières
| 2024-05-16 | Paper |
Digraph redicolouring
European Journal of Combinatorics | 2024-02-05 | Paper |
Spanning eulerian subdigraphs in semicomplete digraphs
Journal of Graph Theory | 2023-10-06 | Paper |
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
Journal of Graph Theory | 2023-10-05 | Paper |
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
Journal of Graph Theory | 2023-10-05 | Paper |
Dichromatic number of chordal graphs
| 2023-09-29 | Paper |
On the minimum number of arcs in $4$-dicritical oriented graphs
| 2023-06-19 | Paper |
Powers of paths in tournaments
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
On the minimum number of inversions to make a digraph $k$-(arc-)strong
| 2023-03-21 | Paper |
Problems, proofs, and disproofs on the inversion number
| 2022-12-18 | Paper |
Overlaying a hypergraph with a graph with bounded maximum degree
Discrete Applied Mathematics | 2022-08-04 | Paper |
On the minimum number of arcs in $k$-dicritical oriented graphs
| 2022-07-03 | Paper |
On the unavoidability of oriented trees
Electronic Notes in Theoretical Computer Science | 2022-04-27 | Paper |
On the Nash number and the diminishing Grundy number of a graph
Discrete Applied Mathematics | 2022-04-20 | Paper |
On the dichromatic number of surfaces
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
On the unavoidability of oriented trees
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
On the semi-proper orientations of graphs
Discrete Applied Mathematics | 2021-04-20 | Paper |
Overlaying a hypergraph with a graph with bounded maximum degree
Algorithms and Discrete Applied Mathematics | 2020-07-21 | Paper |
A variant of the Erdős-Sós conjecture
Journal of Graph Theory | 2020-05-21 | Paper |
Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs
Journal of Combinatorial Theory. Series B | 2020-04-07 | Paper |
Cooperative colorings of trees and of bipartite graphs
The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
scientific article; zbMATH DE number 7150552 (Why is no real title available?)
| 2020-01-13 | Paper |
Bipartite spanning sub(di)graphs induced by 2-partitions
Journal of Graph Theory | 2019-10-31 | Paper |
Subdivisions in digraphs of large out-degree or large dichromatic number
The Electronic Journal of Combinatorics | 2019-08-05 | Paper |
Backbone colouring and algorithms for TDMA scheduling
| 2019-08-01 | Paper |
Tournaments and Semicomplete Digraphs
Springer Monographs in Mathematics | 2019-03-04 | Paper |
Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem
Journal of Discrete Algorithms | 2019-01-18 | Paper |
χ‐bounded families of oriented graphs
Journal of Graph Theory | 2019-01-03 | Paper |
Subdivisions of oriented cycles in digraphs with large chromatic number
Journal of Graph Theory | 2019-01-03 | Paper |
Minimum density of identifying codes of king grids
Discrete Mathematics | 2018-08-15 | Paper |
Complexity dichotomies for the minimum \(\mathcal{F}\)-overlay problem
| 2018-06-15 | Paper |
Bispindles in strongly connected digraphs with large chromatic number
The Electronic Journal of Combinatorics | 2018-06-14 | Paper |
On the minimum size of an identifying code over all orientations of a graph
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Finding a subdivision of a prescribed digraph of order 4
Journal of Graph Theory | 2018-04-27 | Paper |
Minimum density of identifying codes of king grids
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Bispindle in strongly connected digraphs with large chromatic number
| 2018-04-09 | Paper |
Out-degree reducing partitions of digraphs
Theoretical Computer Science | 2018-03-12 | Paper |
On the complexity of compressing two dimensional routing tables with order
Algorithmica | 2018-02-28 | Paper |
Coloring Graphs with Constraints on Connectivity
Journal of Graph Theory | 2017-08-10 | Paper |
Identifying codes for infinite triangular grids with a finite number of rows
Discrete Mathematics | 2017-05-10 | Paper |
Minimum-Density Identifying Codes in Square Grids
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Compressing two-dimensional routing tables with order
| 2016-10-18 | Paper |
Steinberg-like theorems for backbone colouring
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
Finding good 2-partitions of digraphs. II. Enumerable properties
Theoretical Computer Science | 2016-07-05 | Paper |
Trees in tournaments
| 2016-07-01 | Paper |
Proper orientation of cacti
Theoretical Computer Science | 2016-06-30 | Paper |
The complexity of finding arc-disjoint branching flows
Discrete Applied Mathematics | 2016-06-21 | Paper |
Finding good 2-partitions of digraphs. I. Hereditary properties
Theoretical Computer Science | 2016-06-01 | Paper |
Detection number of bipartite graphs and cubic graphs
| 2015-02-09 | Paper |
On the proper orientation number of bipartite graphs
Theoretical Computer Science | 2015-01-06 | Paper |
Design of fault-tolerant on-board networks with variable switch sizes
Theoretical Computer Science | 2014-12-02 | Paper |
Finding a subdivision of a digraph
Theoretical Computer Science | 2014-12-02 | Paper |
(Circular) backbone colouring: forest backbones in planar graphs
Discrete Applied Mathematics | 2014-05-06 | Paper |
List circular backbone colouring
| 2014-05-02 | Paper |
Backbone colouring: tree backbones with small diameter in planar graphs
Theoretical Computer Science | 2013-12-11 | Paper |
Spanning galaxies in digraphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Acyclic edge-colouring of planar graphs (extended abstract)
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
On wheel-free graphs
| 2013-09-09 | Paper |
Finding an induced subdivision of a digraph
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Good edge-labelling of graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Enumerating the edge-colourings and total colourings of a regular graph
Journal of Combinatorial Optimization | 2013-06-13 | Paper |
The game Grundy number of graphs
Journal of Combinatorial Optimization | 2013-06-13 | Paper |
On the Grundy and \(b\)-chromatic numbers of a graph
Algorithmica | 2013-05-16 | Paper |
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
Algorithmica | 2013-05-16 | Paper |
Oriented trees in digraphs
Discrete Mathematics | 2013-04-15 | Paper |
Weighted improper colouring
Journal of Discrete Algorithms | 2013-01-18 | Paper |
\(b\)-coloring of tight graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
Good edge-labelling of graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
New bounds on the Grundy number of products of graphs
Journal of Graph Theory | 2012-09-12 | Paper |
Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Finding an induced subdivision of a digraph
Theoretical Computer Science | 2012-08-10 | Paper |
On spanning galaxies in digraphs
Discrete Applied Mathematics | 2012-05-11 | Paper |
Linear and 2-frugal choosability of graphs of small maximum average degree
Graphs and Combinatorics | 2012-01-24 | Paper |
Weighted Improper Colouring
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Acyclic edge-coloring of planar graphs
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
5-coloring graphs with 4 crossings
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
5-choosability of graphs with 2 crossings
| 2011-05-13 | Paper |
Exact algorithms for \(L(2,1)\)-labeling of graphs
Algorithmica | 2011-03-02 | Paper |
Facial non-repetitive edge-coloring of plane graphs
Journal of Graph Theory | 2011-01-20 | Paper |
Improper coloring of weighted grid and hexagonal graphs
Discrete Mathematics, Algorithms and Applications | 2010-12-15 | Paper |
On the Grundy number of a graph
Parameterized and Exact Computation | 2010-12-07 | Paper |
Improper coloring of unit disk graphs
Networks | 2010-11-24 | Paper |
\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
Discrete Applied Mathematics | 2010-11-05 | Paper |
Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
Discrete Mathematics | 2010-10-19 | Paper |
scientific article; zbMATH DE number 5764899 (Why is no real title available?)
| 2010-08-06 | Paper |
Corrigendum to ``\((p,1)\)-total labelling of graphs [Discrete math. 308 (2008) 496-513]
Discrete Mathematics | 2010-07-07 | Paper |
Grundy number and products of graphs
Discrete Mathematics | 2010-05-05 | Paper |
Complexity of (p,1)-total labelling
Discrete Applied Mathematics | 2010-04-28 | Paper |
Facial colorings using Hall's theorem
European Journal of Combinatorics | 2010-04-27 | Paper |
WDM and directed star arboricity
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Circular choosability
Journal of Graph Theory | 2009-12-18 | Paper |
Choosability of the square of planar subcubic graphs with large girth
Discrete Mathematics | 2009-06-19 | Paper |
3-Facial Coloring of Plane Graphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
About a Brooks-type theorem for improper colouring
| 2009-03-16 | Paper |
Bisimplicial vertices in even-hole-free graphs
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
Hoàng-Reed conjecture holds for tournaments
Discrete Mathematics | 2008-07-11 | Paper |
List Colouring Squares of Planar Graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
\((p,1)\)-total labelling of graphs
Discrete Mathematics | 2008-01-28 | Paper |
Paths with two blocks in \(n\)-chromatic digraphs
Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
Improper Colourings of Unit Disk Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
Journal of Graph Theory | 2007-02-02 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Improper choosability of graphs and maximum average degree
Journal of Graph Theory | 2006-09-06 | Paper |
Fault tolerant on-board networks with priorities
Networks | 2006-03-24 | Paper |
Stable set meeting every longest path
Discrete Mathematics | 2005-02-22 | Paper |
Pancyclic arcs and connectivity in tournaments
Journal of Graph Theory | 2005-02-16 | Paper |
The Push Tree problem
Networks | 2005-01-12 | Paper |
Trees with three leaves are (\(n+1\))-unavoidable
Discrete Applied Mathematics | 2004-08-06 | Paper |
On unavoidability of trees with \(k\) leaves
Graphs and Combinatorics | 2003-07-08 | Paper |
Oriented Hamiltonian cycles in tournaments
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Trees in tournaments
Discrete Mathematics | 2002-10-24 | Paper |
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
Discrete Mathematics | 2002-05-21 | Paper |
Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
Discrete Mathematics | 2002-04-16 | Paper |
Trees with three leaves are \((n+1)\)-unavoidable
| 2001-10-24 | Paper |
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
| 2001-09-30 | Paper |
Finding an Oriented Hamiltonian Path in a Tournament
Journal of Algorithms | 2000-08-27 | Paper |
Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
Journal of Combinatorial Theory. Series B | 2000-06-25 | Paper |
On the inversion number of oriented graphs
| N/A | Paper |
The 3-dicritical semi-complete digraphs
| N/A | Paper |
Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
| N/A | Paper |
Diameter of the inversion graph
| N/A | Paper |
