Petru Valicov

According to our database1, Petru Valicov authored at least 23 papers between 2010 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2020
Exact square coloring of subcubic planar graphs.
CoRR, 2020

2019
Cuts in matchings of 3-connected cubic graphs.
Eur. J. Comb., 2019

Enumerating k-arc-connected orientations.
CoRR, 2019

2017
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Theor. Comput. Sci., 2017

Planar Digraphs without Large Acyclic Sets.
J. Graph Theory, 2017

Cuts in matchings of 3-edge-connected cubic graphs.
CoRR, 2017

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Algorithmica, 2017

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

2015
Planar digraphs without large acyclic sets.
CoRR, 2015

From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014
Strong edge-colouring of sparse planar graphs.
Discret. Appl. Math., 2014

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

2013
Identifying Codes in Line Graphs.
J. Graph Theory, 2013

Strong edge-colouring and induced matchings.
Inf. Process. Lett., 2013

On strong edge-colouring of subcubic graphs.
Discret. Appl. Math., 2013

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

2011
Bounds and complexity results for strong edge colouring of subcubic graphs.
Electron. Notes Discret. Math., 2011

Edge identifying codes.
Electron. Notes Discret. Math., 2011

Extremal graphs for the identifying code problem.
Eur. J. Comb., 2011

Strong edge colouring of subcubic graphs.
Discret. Appl. Math., 2011

2010
MPQ-trees for orthogonal packing problem.
Electron. Notes Discret. Math., 2010


  Loading...