Autor: Onderko, Alfréd - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On M_f-Edge Colorings of Graphs
Autorzy:: Ivančo, Jaroslav
Onderko, Alfréd
Powiązania:: https://bibliotekanauki.pl/articles/32222570.pdf
Data publikacji:: 2022-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: edge coloring
anti-Ramsey number
dominating set
Opis:: An edge coloring φ of a graph G is called an M_f-edge coloring if |φ(v)| ≤ f(v) for every vertex v of G, where φ(v) is the set of colors of edges incident with v and f is a function which assigns a positive integer f(v) to each vertex v. Let K_f (G) denote the maximum number of colors used in an M_f-edge coloring of G. In this paper we establish some bounds on K_f(G), present some graphs achieving the bounds and determine exact values of K_f(G) for some special classes of graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1075-1088
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Edge homogeneous colorings
Autorzy:: Madaras, Tomáš
Onderko, Alfréd
Schweser, Thomas
Powiązania:: https://bibliotekanauki.pl/articles/2048718.pdf
Data publikacji:: 2022
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: homogeneous coloring
Mq-coloring
line graph
role coloring
Opis:: We explore four kinds of edge colorings defined by the requirement of equal number of colors appearing, in particular ways, around each vertex or each edge. We obtain the characterization of graphs colorable in such a way that the ends of each edge see (not regarding the edge color itself) q colors (resp. one end sees q colors and the color sets for both ends are the same), and a sufficient condition for 2-coloring a graph in a way that the ends of each edge see (with the omission of that edge color) altogether q colors. The relations of these colorings to Mq-colorings and role colorings are also discussed; we prove an interpolation theorem for the numbers of colors in edge coloring where all edges around each vertex have q colors.
Źródło:: Opuscula Mathematica; 2022, 42, 1; 65-73
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja