Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Stanislav Jendrol"'
Publikováno v:
Opuscula Mathematica, Vol 38, Iss 6, Pp 819-827 (2018)
In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring. Moreover, we give several sharpness examples and formul
Externí odkaz:
https://doaj.org/article/5fca504e6ea84242be0952ac61b5dfd9
Autor:
Stanislav Jendrol'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 1, p 351 (2024)
Externí odkaz:
https://doaj.org/article/b2e06f52f0d241c9a3933ddb639f83fe
Autor:
Jochen Harant, Stanislav Jendrol'
Publikováno v:
Opuscula Mathematica, Vol 39, Iss 6, Pp 829-837 (2019)
Let \(k\) be a positive integer, \(G\) be a graph on \(V(G)\) containing a path on \(k\) vertices, and \(w\) be a weight function assigning each vertex \(v\in V(G)\) a real weight \(w(v)\). Upper bounds on the weight \(w(P)=\sum_{v\in V(P)}w(v)\) of
Externí odkaz:
https://doaj.org/article/a1d290e002b342caa04a48faad4d3508
Autor:
Stanislav Jendrol’, Alfréd Onderko
Publikováno v:
Discrete Applied Mathematics. 332:129-134
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5681c83b84623d8714d08f37e6f44b76
https://doi.org/10.1016/j.dam.2023.02.008
https://doi.org/10.1016/j.dam.2023.02.008
Publikováno v:
Discrete Applied Mathematics. 313:71-79
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 plane graph we are to color these three sets so that any pair of adjacen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c768db52a688dd8499987a19716b7886
https://doi.org/10.1016/j.dam.2022.02.006
https://doi.org/10.1016/j.dam.2022.02.006
Publikováno v:
Graphs and Combinatorics. 37:1823-1839
Colourful connection concepts in graph theory such as rainbow connection, proper connection, odd connection or conflict-free connection have received a lot of attention. For an integer $$k \ge 1$$ we call a path P in a graph G k-colourful, if at leas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c83459e146421a9e332d50ced5bea4d2
https://doi.org/10.1007/s00373-021-02322-9
https://doi.org/10.1007/s00373-021-02322-9
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 5-38 (2021)
A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory wa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1817f97f5400e23a58298a8ea1be20d1
https://doaj.org/article/2cf660674efe40b4bee202b6b082fac2
https://doaj.org/article/2cf660674efe40b4bee202b6b082fac2
Publikováno v:
Graphs and Combinatorics. 36:1391-1399
It is well known that if $$G = (V, E)$$ G = ( V , E ) is a connected multigraph and $$X\subset V$$ X ⊂ V is a subset of even order, then G contains a spanning forest H such that each vertex from X has an odd degree in H and all the other vertices h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::099eaa1f9cd7dc7311dd5647e4403e1b
https://doi.org/10.1007/s00373-020-02225-1
https://doi.org/10.1007/s00373-020-02225-1
Publikováno v:
Discrete Applied Mathematics. 282:80-85
For a fixed positive integer p , a coloring of the edges of a multigraph G is called p -acyclic coloring if every cycle C in G contains at least min { | C | , p + 1 } colors. The least number of colors needed for a p -acyclic coloring of G is the p -
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2b0c1b39fa2ee89b52454f90e18694
https://doi.org/10.1016/j.dam.2019.11.003
https://doi.org/10.1016/j.dam.2019.11.003
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 1, Pp 51-65 (2020)
A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e414bb658b9fd24fbf4822810a2cc54c
https://doaj.org/article/8aa66e6fb5e14bde85c2f1afe303c78d
https://doaj.org/article/8aa66e6fb5e14bde85c2f1afe303c78d