On the cores of games arising from integer edge covering functions of graphs
DOI10.1007/s10878-012-9484-9zbMath1308.91025OpenAlexW2041850538MaRDI QIDQ386434
Boram Park, Suh-Ryung Kim, Hye Kyung Kim
Publication date: 9 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9484-9
decomposition theoremsedge covering problemsinteger edge covering functions of graphsinteger edge covering problems on graphs
Cooperative games (91A12) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
This page was built for publication: On the cores of games arising from integer edge covering functions of graphs