Labelled packing functions in graphs
DOI10.1016/j.ipl.2019.105863zbMath1481.05127OpenAlexW2984247531WikidataQ126867033 ScholiaQ126867033MaRDI QIDQ2011027
Erica G. Hinrichsen, Martín D. Safe, V. Leoni
Publication date: 28 November 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2019.105863
computational complexitystrongly chordal graphlinear-time algorithmclique independencelabelled packing problem
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- On 2-limited packings of complete grid graphs
- Variations of \(Y\)-dominating functions on graphs
- Limited packings in graphs
- Characterizations of strongly chordal graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- The multiple domination and limited packing problems in graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- Limited packing and multiple domination problems: polynomial time reductions
- The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
- On the complexity of the {k}-packing function problem
- $$\{k\}$$-Packing Functions of Graphs
- Algorithmic Aspects of Neighborhood Numbers
- A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs
This page was built for publication: Labelled packing functions in graphs
