The following pages link to Petru Valicov (Q477353):
Displayed 24 items.
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- Cuts in matchings of 3-connected cubic graphs (Q1633599) (← links)
- MPQ-trees for the orthogonal packing problem (Q1935724) (← links)
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth (Q2094884) (← links)
- Enumerating \(k\)-arc-connected orientations (Q2211357) (← links)
- \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) (Q2225423) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- (Q2857369) (← links)
- (Q2857388) (← links)
- MPQ-trees for orthogonal packing problem (Q2883589) (← links)
- Planar Digraphs without Large Acyclic Sets (Q5272647) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- On powers of interval graphs and their orders (Q6261767) (← links)
- (2, 3)-bipartite graphs are strongly 6-edge-choosable (Q6304990) (← links)
- Computer assisted discharging procedure on planar graphs: application to 2-distance coloring (Q6390490) (← links)