5 citations · 5 across the 1 of their papers we have counts for
2 papers
math.CO2020
Proper connection and proper-walk connection of digraphs
Anna Fiedorowicz, Elżbieta Sidorowicz, Èric Sopena
An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices , the digraph contains a directed path (a directed walk) from to…
cs.DM2015★ 5 cited
Acyclic colourings of graphs with bounded degree
Anna Fiedorowicz, Elżbieta Sidorowicz
A -colouring (not necessarily proper) of vertices of a graph is called {\it acyclic}, if for every pair of distinct colours and the subgraph induced by the edges whose e…