Petru Valicov

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth The Electronic Journal of Combinatorics	2022-11-08	Paper
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring	2022-02-08	Paper
Exact square coloring of subcubic planar graphs Discrete Applied Mathematics	2021-03-25	Paper
\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) European Journal of Combinatorics	2021-02-08	Paper
Enumerating \(k\)-arc-connected orientations Algorithmica	2020-11-11	Paper
Cuts in matchings of 3-connected cubic graphs European Journal of Combinatorics	2018-12-20	Paper
(2, 3)-bipartite graphs are strongly 6-edge-choosable	2018-08-03	Paper
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity Algorithmica	2017-10-09	Paper
Planar digraphs without large acyclic sets Journal of Graph Theory	2017-06-30	Paper
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. Theoretical Computer Science	2017-02-27	Paper
Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs Graph-Theoretic Concepts in Computer Science	2016-10-21	Paper
Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs Discrete Mathematics	2015-10-08	Paper
On powers of interval graphs and their orders	2015-05-13	Paper
From edge-coloring to strong edge-coloring The Electronic Journal of Combinatorics	2015-04-22	Paper
Strong edge-colouring of sparse planar graphs Discrete Applied Mathematics	2014-12-03	Paper
Strong edge-colouring and induced matchings Information Processing Letters	2014-04-14	Paper
On strong edge-colouring of subcubic graphs Discrete Applied Mathematics	2014-04-10	Paper
Bounds and complexity results for strong edge colouring of subcubic graphs	2013-11-01	Paper
Edge identifying codes	2013-11-01	Paper
Identifying codes in line graphs Journal of Graph Theory	2013-07-31	Paper
MPQ-trees for the orthogonal packing problem JMMA. Journal of Mathematical Modelling and Algorithms	2013-02-19	Paper
MPQ-trees for orthogonal packing problem Electronic Notes in Discrete Mathematics	2012-05-13	Paper
Strong edge colouring of subcubic graphs Discrete Applied Mathematics	2011-10-27	Paper
Extremal graphs for the identifying code problem European Journal of Combinatorics	2011-04-08	Paper

Research outcomes over time

This page was built for person: Petru Valicov