146 citations
- Université Paris Dauphine-PSLFR65 papers
- Centre National de la Recherche ScientifiqueFR52 papers
- Université Paris Sciences et LettresFR27 papers
- University of LuxembourgLU9 papers
- École Nationale de l’Aviation CivileFR6 papers
- Institut Universitaire de FranceFR6 papers
- Laboratoire d'Intégration des Systèmes et des TechnologiesFR5 papers
- AGH University of KrakowPL4 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR4 papers
- Hungarian Academy of SciencesHU4 papers
- Korea Advanced Institute of Science and TechnologyKR4 papers
- Laboratoire des Sciences pour la Conception, l'Optimisation et la ProductionFR4 papers
7 papers · 1 filter
On S-packing edge-colorings of cubic graphs
Nicolas Gastineau, Olivier Togni
Given a non-decreasing sequence S = (s 1,s 2,. .. ,s k) of positive integers, an S-packing edge-coloring of a graph G is a partition of the edge set of G into k subsets {X 1 ,X 2,.…
Finding branch-decompositions of matroids, hypergraphs, and more
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Given subspaces of a finite-dimensional vector space over a fixed finite field , we wish to find a "branch-decomposition" of these subspaces of width at most tha…
Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center
Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos
In -Center we are given a (possibly edge-weighted) graph and are asked to select at most vertices (centers), so that all other vertices are at distance at most from…
Exact distance coloring in trees
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan +1
For an integer and an even integer , consider the graph obtained from a large complete -ary tree by connecting with an edge any two vertices at distance exactly …
On packing chromatic number of subcubic outerplanar graphs
Nicolas Gastineau, P{ř}emysl Holub, Olivier Togni
Although it has recently been proved that the packing chromatic number is unbounded on the class of subcubic graphs, there exists subclasses in which the packing chromatic number i…
Defective Coloring on Classes of Perfect Graphs
Rémy Belmonte, Michael Lampis, Valia Mitsou
In Defective Coloring we are given a graph and two integers , and are asked if we can -color so that the maximum degree induced by any color class is at mos…