Petru Valicov

Available identifiers

zbMath Open valicov.petruMaRDI QIDQ477353

List of research outcomes

Publication	Date of Publication	Type
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth	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	2021-03-25	Paper
\(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\)	2021-02-08	Paper
Enumerating \(k\)-arc-connected orientations	2020-11-11	Paper
Cuts in matchings of 3-connected cubic graphs	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	2017-10-09	Paper
Planar Digraphs without Large Acyclic Sets	2017-06-30	Paper
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.	2017-02-27	Paper
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs	2016-10-21	Paper
Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs	2015-10-08	Paper
On powers of interval graphs and their orders	2015-05-13	Paper
From edge-coloring to strong edge-coloring	2015-04-22	Paper
Strong edge-colouring of sparse planar graphs	2014-12-03	Paper
Strong edge-colouring and induced matchings	2014-04-14	Paper
On strong edge-colouring of subcubic graphs	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	2013-07-31	Paper
MPQ-trees for the orthogonal packing problem	2013-02-19	Paper
MPQ-trees for orthogonal packing problem	2012-05-13	Paper
Strong edge colouring of subcubic graphs	2011-10-27	Paper
Extremal graphs for the identifying code problem	2011-04-08	Paper

Research outcomes over time

This page was built for person: Petru Valicov