Generalized limited packings of some graphs with a limited number of P₄-partners
DOI10.1016/J.TCS.2014.11.014zbMATH Open1311.05186OpenAlexW1965121516MaRDI QIDQ2344754FDOQ2344754
Authors: E. Hinrichsen, V. Leoni, M. P. 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
Recommendations
- The multiple domination and limited packing problems in graphs
- On graphs with 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, \(P_{4}\)-tidy and split graphs
- Limited Packings in Graphs
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Transitiv orientierbare Graphen
- Limited packings in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-tuple domination in graphs
- Relations between packing and covering numbers of a tree
- The multiple domination and limited packing problems in graphs
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- On the sibling-structure of perfect graphs
Cited In (7)
- Labelled packing functions in graphs
- Limited packing and multiple domination problems: polynomial time reductions
- Graphs with unique maximum packing of closed neighborhoods
- (Open) packing number of some graph products
- The multiple domination and limited packing problems in graphs
- On graphs with limited number of \(P_{4}\)-partners
- Title not available (Why is that?)
This page was built for publication: Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344754)