Elżbieta Sidorowicz

collaborators

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 $(u, v)$ , the digraph $D$ contains a directed path (a directed walk) from $u$ to…

math.CO2020

Equitable $d$ -degenerate choosability of graphs

E. Drgas-Burchardt, H. Furmańczyk, E. Sidorowicz

Let $D_{d}$ be the class of $d$ -degenerate graphs and let $L$ be a list assignment for a graph $G$ . A colouring of $G$ such that every vertex receives a colour from its li…

Proper connection and proper-walk connection of digraphs

Equitable d-degenerate choosability of graphs

Equitable $d$ -degenerate choosability of graphs