Hypergraph operations preserving sc-greediness
Piotr Borowiecki, Ewa Drgas‐Burchardt, Elżbieta Sidorowicz · Discussiones Mathematicae Graph Theory · 2023
Given a hypergraph H and a function f : V (H) -→ N, we say that H is f -choosable if there exists a proper vertex colouring φ of H such that φ(v) ∈ L(v) for all v ∈ V (H), whereThe class of sc-greedy hypergraphs is closed under the union of hypergraphs having at most one vertex in common.In this paper we consider sc-greediness of the union of hypergraphs having two vertices in common.We investigate this operation when one of the arguments is an arbitrary sc-greedy hypergraph while the second one is a hyperpath.Our research is motivated by the possibility of obtaining improved bounds on the sumchoice-number of graphs and new applications to the resource allocation problems in computer systems.