- Tytuł:
- Regular Colorings in Regular Graphs
- Autorzy:
-
Bernshteyn, Anton
Khormali, Omid
Martin, Ryan R.
Rollin, Jonathan
Rorabaugh, Danny
Shan, Songling
Uzzell, Andrew J. - Powiązania:
- https://bibliotekanauki.pl/articles/31516306.pdf
- Data publikacji:
- 2020-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
edge coloring
graph factors
regular graphs - Opis:
- An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r − 1 edges of one color and 1 edge of a different color. In this paper, we completely characterize all 4-regular pseudographs (graphs that may contain parallel edges and loops) which do not have a (3, 1)-coloring. Also, for each r ≥ 6 we construct graphs that are not (r −1, 1)-colorable and, more generally, are not (r − t, t)-colorable for small t.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 795-806
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł