Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
From MaRDI portal
Publication:2344754
DOI10.1016/j.tcs.2014.11.014zbMath1311.05186OpenAlexW1965121516MaRDI QIDQ2344754
V. Leoni, Erica G. Hinrichsen, Maria Patricia Dobson
Publication date: 18 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.014
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Graphs with unique maximum packing of closed neighborhoods ⋮ (Open) packing number of some graph products ⋮ Labelled packing functions in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Limited packings in graphs
- \(k\)-tuple domination in graphs
- Relations between packing and covering numbers of a tree
- The multiple domination and limited packing problems in graphs
- On the sibling-structure of perfect graphs
- The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Transitiv orientierbare Graphen