8 citations · 13 across the 3 of their papers we have counts for
4 papers
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…
Equitable -degenerate choosability of graphs
E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz
Let be the class of -degenerate graphs and let be a list assignment for a graph . A colouring of such that every vertex receives a colour from its li…
Equitable List Vertex Colourability and Arboricity of Grids
Ewa Drgas-Burchardt, Janusz Dybizbański, Hanna Furmańczyk +1
A graph is equitably -list arborable if for any -uniform list assignment , there is an equitable -colouring of whose each colour class induces an acyclic graph.…
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…