التفاصيل البيبلوغرافية
| العنوان: |
Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common |
| المؤلفون: |
Drgas-Burchardt Ewa, Sidorowicz Elżbieta |
| المصدر: |
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 893-917 (2020) |
| بيانات النشر: |
University of Zielona Góra, 2020. |
| سنة النشر: |
2020 |
| المجموعة: |
LCC:Mathematics |
| مصطلحات موضوعية: |
hypergraphs, sum-list colouring, induced hereditary classes, forbidden hypergraphs, 05c15, 05c65, Mathematics, QA1-939 |
| الوصف: |
Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) colours to a vertex v. The sum choice number isc() of is defined to be the minimum of Σv∈V()f(v) over all functions f such that is f-choosable. For an arbitrary hypergraph the inequality χsc() ≤ |V ()| + |ɛ ()| holds, and hypergraphs that attain this upper bound are called sc-greedy. In this paper we characterize sc-greedy hypergraphs that are unions of a hypercycle and a hyperpath having at most two vertices in common. Consequently, we characterize the hypergraphs of this type that are forbidden for the class of sc-greedy hypergraphs. |
| نوع الوثيقة: |
article |
| وصف الملف: |
electronic resource |
| اللغة: |
English |
| تدمد: |
2083-5892 |
| Relation: |
https://doaj.org/toc/2083-5892 |
| DOI: |
10.7151/dmgt.2312 |
| URL الوصول: |
https://doaj.org/article/f59e5a0c03a3441484ed2fb32f110b67 |
| رقم الانضمام: |
edsdoj.f59e5a0c03a3441484ed2fb32f110b67 |
| قاعدة البيانات: |
Directory of Open Access Journals |
Full Text Finder