2 citations · 2 across the 7 of their papers we have counts for
7 papers
Brooks-type theorem for -hued coloring of graphs
Stanislav Jendroľ, Alfréd Onderko
An -hued coloring of a simple graph is a proper coloring of its vertices such that every vertex is adjacent to at least differently colored vertices. T…
Loose edge-connection of graphs
Christoph Brause, Stanislav Jendrol, Ingo Schiermeyer
In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and obtained a lot of attention. In this paper, we investigate the…
On the cyclic coloring conjecture
Stanislav Jendrol, Roman Sotak
A cyclic coloring of a plane graph is a coloring of its vertices such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic c…
Graph polynomials and paintability of plane graphs
Jarosław Grytczuk, Stanislav Jendrol', Mariusz Zając
There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a pl…
On specific factors in graphs
Csilla Bujtás, Stanislav Jendrol, Zsolt Tuza
It is well known that if } is a multigraph and is a subset of even order, then contains a spanning forest such that each vertex from has an odd…
Graphs with conflict-free connection number two
Hong Chang, Trung Duy Doan, Zhong Huang +3
An edge-colored graph is \emph{conflict-free connected} if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The \emph{c…
Conflict-free vertex-connections of graphs
Xueliang Li, Yingying Zhang, Xiaoyu Zhu +2
A path in a vertex-colored graph is called \emph{conflict free} if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be \emph{conflict-free ve…