Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Massimiliano Marangio"'
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 118-121 (2023)
Externí odkaz:
https://doaj.org/article/99f29db0ab784d54b054320c08f93591
Publikováno v:
Discrete Mathematics Letters, Vol 10, Pp 1-8 (2022)
Externí odkaz:
https://doaj.org/article/fef16f0364de42e8a074a9f753547fdd
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.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84861d7167c639894ea5dfef1c95fd63
https://doi.org/10.7151/dmgt.2412
https://doi.org/10.7151/dmgt.2412
Publikováno v:
Graphs and Combinatorics. 34:1539-1551
The chromatic edge stability number $$ es _{\chi }(G)$$ of a graph G is the minimum number of edges whose removal results in a graph $$H \subseteq G$$ with chromatic number $$\chi (H) = \chi (G) - 1$$ . The chromatic bondage number $$\rho (G)$$ of G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8f058f1ec8886223c1a18455a4849e9
https://doi.org/10.1007/s00373-018-1972-y
https://doi.org/10.1007/s00373-018-1972-y
Publikováno v:
Electronic Notes in Discrete Mathematics. 63:49-58
A simple graph G = ( V , E ) is called L-colorable if there is a proper coloring c of the vertices with c ( v ) ∈ L ( v ) for all v ∈ V where L ( v ) is an assignment of colors to v. A function f : V → N is called a choice function of G if G is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e4ceee2a01d314c7959d14d9bfe6736
https://doi.org/10.1016/j.endm.2017.10.061
https://doi.org/10.1016/j.endm.2017.10.061
Publikováno v:
Discrete Mathematics. 344:112391
Let G = ( V , E ) be a simple graph and for every vertex v ∈ V let L ( v ) be a set (list) of available colors. The graph G is called L -colorable if there is a proper coloring φ of the vertices with φ ( v ) ∈ L ( v ) for all v ∈ V . A functi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07147339fbcfbdd172a32a4164c89a71
https://doi.org/10.1016/j.disc.2021.112391
https://doi.org/10.1016/j.disc.2021.112391
Publikováno v:
Discrete Mathematics. 340:2633-2640
Let G = ( V E ) be a simple graph and for every vertex v ∈ V let L ( v ) be a set (list) of available colors. G is called L -colorable if there is a proper coloring φ of the vertices with φ ( v ) ∈ L ( v ) for all v ∈ V . A function f : V →
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5b5b9027e53d8f038948a3598fb930f
https://doi.org/10.1016/j.disc.2016.11.028
https://doi.org/10.1016/j.disc.2016.11.028
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:
Discrete Mathematics. 338:1722-1729
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 Z r such that for each color i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd84106df8b378fb140a7fcc5f1d4103
https://doi.org/10.1016/j.disc.2014.09.012
https://doi.org/10.1016/j.disc.2014.09.012