$$\{k\}$$-Packing Functions of Graphs

DOI10.1007/978-3-319-09174-7_28zbMath1451.05192OpenAlexW2167332590MaRDI QIDQ3195342

V. Leoni, Erica G. Hinrichsen

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_28

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

A new approach on locally checkable problems ⋮ NP-completeness of the \(\{k \}\)-packing function problem in graphs ⋮ On the complexity of the {k}-packing function problem ⋮ Labelled packing functions in graphs ⋮ Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs

This page was built for publication: $$\{k\}$$-Packing Functions of Graphs