\{k\}-Packing Functions of Graphs

DOI10.1007/978-3-319-09174-7_28MaRDI QIDQ3195342zbMATH OpenOpenAlexFDO

Authors V. Leoni, E. 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)

Recommendations

• scientific article; zbMATH DE number 1409232
• Labelled packing functions in graphs
• Packing functions and dominating functions of countable graphs
• On the \(k\)-limited packing numbers in graphs
• On the packing numbers in graphs
• Packing of graphs - a survey
• Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
• scientific article; zbMATH DE number 1022391
• NP-completeness of the \(\{k \}\)-packing function problem in graphs
• Packings in complete graphs

Cited in

(11)

• Universal maximal packing functions of graphs
• Labelled packing functions in graphs
• A new approach on locally checkable problems
• Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
• The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
• On the complexity of the {\(k\)}-packing function problem
• NP-completeness of the \(\{k \}\)-packing function problem in graphs
• The packing measure of the graphs and level sets of certain continuous functions
• Packing $k$-Matchings and $k$-Critical Graphs
• The maximum weight \((\{K_1,K_2\},k,l)\)-packing problem in a graph
• A unified approach for domination and packing problems in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195342)