Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

28 résultats
Page :
triés par
Image document

Strong edge-colouring and induced matchings

 Hervé Hocquard , Pascal Ochem , Petru Valicov
Information Processing Letters, 2013, 113 (19-21), pp.836-843. ⟨10.1016/j.ipl.2013.07.026⟩
Article dans une revue hal-00609454v4
Image document

Exact square coloring of subcubic planar graphs

 Florent Foucaud , Hervé Hocquard , Suchismita Mishra , Narayanan Narayanan , Reza Naserasr , et al.
Discrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩
Article dans une revue hal-02925881v3
Image document

Strong edge-coloring of $(3, \Delta)$-bipartite graphs

 Julien Bensmail , Aurélie Lagoutte , Petru Valicov
Discrete Mathematics, 2016, 339 (1), ⟨10.1016/j.disc.2015.08.026⟩
Article dans une revue hal-01080279v2

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds

 Florent Foucaud , George B. Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov
Theoretical Computer Science, 2017, 668, pp.43-58. ⟨10.1016/j.tcs.2017.01.006⟩
Article dans une revue hal-01198783v1
Image document

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring

 Xuan Hoang La , Petru Valicov
2022
Pré-publication, Document de travail hal-03576729v1

Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs.

 Foucaud F. , Mertzios G. B. , Reza Naserasr , Parreau A. , Petru Valicov
Lecture Notes in Computer Science, 2016
Article dans une revue hal-01520744v1
Image document

On strong edge-colouring of subcubic graphs

 Hervé Hocquard , Mickael Montassier , André Raspaud , Petru Valicov
Discrete Applied Mathematics, 2013, 161 (16-17), pp.2467-2479. ⟨10.1016/j.dam.2013.05.021⟩
Article dans une revue hal-00686021v2

From Edge-Coloring to Strong Edge-Coloring

 Valentin Borozan , Gerard Jennhwa Chang , Nathann Cohen , Shinya Fujita , Narayanan Narayanan N Narayanan , et al.
The Electronic Journal of Combinatorics, 2015, 22 (2), pp.P2.9
Article dans une revue hal-01144153v1

On powers of interval graphs and their orders

 Florent Foucaud , Reza Naserasr , Aline Parreau , Petru Valicov
2015
Pré-publication, Document de travail hal-01198830v1

Planar digraphs without large acyclic sets

 Kolja Knauer , Petru Valicov , Paul S, Wenger
Journal of Graph Theory, 2017, 85 (1), pp.288-291. ⟨10.1002/jgt.22061⟩
Article dans une revue hal-01198779v1
Image document

Bounds and complexity results for strong edge colouring of subcubic graphs

 Hervé Hocquard , Pascal Ochem , Petru Valicov
EuroComb'11, Aug 2011, Budapest, France. A paraitre
Communication dans un congrès hal-00592130v1

Edge identifying codes

 Florent Foucaud , Sylvain Gravier , Reza Naserasr , Aline Parreau , Petru Valicov
European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Aug 2011, Budapest, Hungary. pp.343-348, ⟨10.1016/j.endm.2011.09.056⟩
Communication dans un congrès istex hal-00960555v1
Image document

Identifying codes in line graphs

 Florent Foucaud , Sylvain Gravier , Reza Naserasr , Aline Parreau , Petru Valicov
Journal of Graph Theory, 2013, 73 (4), pp.425-448. ⟨10.1002/jgt.21686⟩
Article dans une revue hal-00605406v2
Image document

Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

 Kolja Knauer , Xuan Hoang La , Petru Valicov
The Electronic Journal of Combinatorics, 2022, 29 (4), ⟨10.37236/10914⟩
Article dans une revue hal-03583220v1

(2, 3)-bipartite graphs are strongly 6-edge-choosable

 Petru Valicov
2020
Pré-publication, Document de travail hal-02436240v1
Image document

On packing, colouring and identification problems

 Petru Valicov
Data Structures and Algorithms [cs.DS]. Université Sciences et Technologies - Bordeaux I, 2012. English. ⟨NNT : ⟩
Thèse tel-00801982v1
Image document

Strong edge coloring of subcubic graphs

 Hervé Hocquard , Petru Valicov
Discrete Applied Mathematics, 2011, 159 (15), pp.1650-1657. ⟨10.1016/j.dam.2011.06.015⟩
Article dans une revue hal-00592185v1
Image document

MPQ-trees for the orthogonal packing problem

 Cédric Joncour , Arnaud Pêcher , Petru Valicov
Journal of Mathematical Modelling and Algorithms, 2012, 11 (1), pp.3-22. ⟨10.1007/s10852-011-9159-z⟩
Article dans une revue hal-00611528v1
Image document

Extremal graphs for the identifying code problem

 Florent Foucaud , Eleonora Guerrini , Matjaz Kovse , Reza Naserasr , Aline Parreau , et al.
European Journal of Combinatorics, 2011, 32 (4), pp.628-638. ⟨10.1016/j.ejc.2011.01.002⟩
Article dans une revue hal-00477467v4
Image document

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs

 Florent Foucaud , George Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov
International Workshop on Graph-Theoretic Concepts in Computer Science WG 2015, Jun 2015, Munich, Germany. pp.175 - 471, ⟨10.1007/978-3-662-53174-7_32⟩
Communication dans un congrès hal-01518713v1
Image document

Enumerating $k$-arc-connected orientations

 Sarah Blind , Kolja Knauer , Petru Valicov
Algorithmica, 2020, 82 (12), ⟨10.1007/s00453-020-00738-y⟩
Article dans une revue hal-02435175v2
Image document

Strong edge-colouring of sparse planar graphs

 Julien Bensmail , Ararat Harutyunyan , Hervé Hocquard , Petru Valicov
Discrete Applied Mathematics, 2014, ⟨10.1016/j.dam.2014.07.006⟩
Article dans une revue hal-00932945v3

MPQ-trees for orthogonal packing problem

 Cedric Joncour , Arnaud Pêcher , Petru Valicov
International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.423-429
Communication dans un congrès hal-00453408v1
Image document

Cliques in exact distance powers of graphs of given maximum degree

 Florent Foucaud , Suchismita Mishra , Narayanan Narayanan , Reza Naserasr , Petru Valicov
LAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium, May 2021, Sao Paulo, Brazil. pp.427-436, ⟨10.1016/j.procs.2021.11.052⟩
Communication dans un congrès hal-03540673v1
Image document

Cuts in matchings of 3-connected cubic graphs

 Kolja Knauer , Petru Valicov
European Journal of Combinatorics, 2019, 76, pp.27-36. ⟨10.1016/j.ejc.2018.09.004⟩
Article dans une revue hal-01672548v2
Image document

$r$-hued ( r + 1 ) -coloring of planar graphs with girth at least 8 for $r$ ≥ 9

 Xuan Hoang La , Mickaël Montassier , Alexandre Pinlou , Petru Valicov
European Journal of Combinatorics, 2021, 91, pp.#103219. ⟨10.1016/j.ejc.2020.103219⟩
Article dans une revue lirmm-03475125v1
Image document

r-hued coloring of planar graphs with girth at least 8

 Hoang La , Mickaël Montassier , Alexandre Pinlou , Petru Valicov
BGW 2019 - 5th Bordeaux Graph Workshop, Oct 2019, Bordeaux, France
Communication dans un congrès lirmm-02938645v1

Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity

 Florent Foucaud , George B. Mertzios , Reza Naserasr , Aline Parreau , Petru Valicov
Algorithmica, 2017, 78 (3), pp.914-944. ⟨10.1007/s00453-016-0184-1⟩
Article dans une revue hal-01198784v1
Page :