1 citations · 1 across the 1 of their papers we have counts for
4 papers
Computer assisted discharging procedure on planar graphs: application to 2-distance coloring
Hoang La, Petru Valicov
Using computational techniques we provide a framework for proving results on subclasses of planar graphs via discharging method. The aim of this paper is to apply these techniques…
Exact square coloring of subcubic planar graphs
Florent Foucaud, Hervé Hocquard, Suchismita Mishra +4
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 rec…
Enumerating -arc-connected orientations
Sarah Blind, Kolja Knauer, Petru Valicov
We study the problem of enumerating the -arc-connected orientations of a graph , i.e., generating each exactly once. A first algorithm using submodular flow optimization is e…
(2, 3)-bipartite graphs are strongly 6-edge-choosable
Petru Valicov
Kang and Park recently showed that every cubic (loopless) multigraph is incidence 6-choosable [On incidence choosability of cubic graphs. \emph{arXiv}, April 2018]. Equivalently, e…