Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Margrit Voigt"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 3, Pp 689-703 (2019)
A (graph) property 𝒫 is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties 𝒫.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de5013226ad82e2d7da6ee0ab85d9598
https://doaj.org/article/6e3fe3f398a346f697d7223b58def5dd
https://doaj.org/article/6e3fe3f398a346f697d7223b58def5dd
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 3, Pp 709-722 (2016)
Let G = (V,E) be a simple graph and for every edge e ∈ E let L(e) be a set (list) of available colors. The graph G is called L-edge colorable if there is a proper edge coloring c of G with c(e) ∈ L(e) for all e ∈ E. A function f : E → ℕ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0078cbee54b4f1c4d1c0e6b1cbea9744
https://doaj.org/article/2721c510c12b427ab927860f0dff8b84
https://doaj.org/article/2721c510c12b427ab927860f0dff8b84
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 1, Pp 167-179 (2013)
Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6f14bae81da76d6facc375061bb118f1
https://doaj.org/article/704be424c10d45d396fb8f1241011be8
https://doaj.org/article/704be424c10d45d396fb8f1241011be8
Publikováno v:
Discussiones Mathematicae Graph Theory. 22:5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca7c72737abedfb9542f8490e77e0ace
https://doi.org/10.7151/dmgt.1153
https://doi.org/10.7151/dmgt.1153
Publikováno v:
Discussiones Mathematicae Graph Theory. 19:159
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (D1,D1)-partitionable planar graphs with respect to the property D1 "to be a forest".
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7c06b52b9b048d73fd4e6a6fb286b2a
https://doi.org/10.7151/dmgt.1092
https://doi.org/10.7151/dmgt.1092