Petru Valicov

According to our database, Petru Valicov authored at least 26 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

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

Hoang La, Petru Valicov

CoRR, 2022

Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth.

Kolja Knauer, Hoang La, Petru Valicov

Electron. J. Comb., 2022

2021

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

Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov

Eur. J. Comb., 2021

Exact square coloring of subcubic planar graphs.

Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov

Discret. Appl. Math., 2021

Cliques in exact distance powers of graphs of given maximum degree.

Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Enumerating k-Arc-Connected Orientations.

Sarah Blind, Kolja Knauer, Petru Valicov

Algorithmica, 2020

2019

Cuts in matchings of 3-connected cubic graphs.

Kolja Knauer, Petru Valicov

Eur. J. Comb., 2019

2017

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

Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov

Theor. Comput. Sci., 2017

Planar Digraphs without Large Acyclic Sets.

Kolja Knauer, Petru Valicov, Paul S. Wenger

J. Graph Theory, 2017

Cuts in matchings of 3-edge-connected cubic graphs.

Kolja Knauer, Petru Valicov

CoRR, 2017

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

2016

Strong edge-coloring of (3, Δ)-bipartite graphs.

Julien Bensmail, Aurélie Lagoutte, Petru Valicov

Discret. Math., 2016

2015

Planar digraphs without large acyclic sets.

Kolja Knauer, Petru Valicov

CoRR, 2015

From Edge-Coloring to Strong Edge-Coloring.

Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov

Electron. J. Comb., 2015

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

Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov

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

2014

Strong edge-colouring of sparse planar graphs.

Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard, Petru Valicov

Discret. Appl. Math., 2014

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

Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov

CoRR, 2014

2013

Identifying Codes in Line Graphs.

Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov

J. Graph Theory, 2013

Strong edge-colouring and induced matchings.

Hervé Hocquard, Pascal Ochem, Petru Valicov

Inf. Process. Lett., 2013

On strong edge-colouring of subcubic graphs.

Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov

Discret. Appl. Math., 2013

2012

On packing, colouring and identification problems. (Problèmes de placement, de coloration et d'identification).

Petru Valicov

PhD thesis, 2012

2011

Bounds and complexity results for strong edge colouring of subcubic graphs.

Hervé Hocquard, Pascal Ochem, Petru Valicov

Electron. Notes Discret. Math., 2011

Edge identifying codes.

Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov

Electron. Notes Discret. Math., 2011

Extremal graphs for the identifying code problem.

Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov

Eur. J. Comb., 2011

Strong edge colouring of subcubic graphs.

Hervé Hocquard, Petru Valicov

Discret. Appl. Math., 2011

2010

MPQ-trees for orthogonal packing problem.

Cédric Joncour, Arnaud Pêcher, Petru Valicov

Electron. Notes Discret. Math., 2010