Generalized limited packings of some graphs with a limited number of P₄-partners
From MaRDI portal
Publication:2344754
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
Cites work
- scientific article; zbMATH DE number 1375569 (Why is no real title available?)
- scientific article; zbMATH DE number 1456953 (Why is no real title available?)
- Limited packings in graphs
- On the sibling-structure of perfect graphs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Relations between packing and covering numbers of a tree
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- The multiple domination and limited packing problems in graphs
- Transitiv orientierbare Graphen
- \(k\)-tuple domination in graphs
Cited in
(7)- On graphs with limited number of \(P_{4}\)-partners
- Graphs with unique maximum packing of closed neighborhoods
- Limited packing and multiple domination problems: polynomial time reductions
- The multiple domination and limited packing problems in graphs
- scientific article; zbMATH DE number 6831075 (Why is no real title available?)
- (Open) packing number of some graph products
- Labelled packing functions in graphs
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)
