On the number of 2-packings in a connected graph
From MaRDI portal
(Redirected from Publication:1761463)
Recommendations
Cites work
- A Note on Independent Sets in Trees
- Coloring with no 2-colored \(P_4\)'s
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Labelling Graphs with a Condition at Distance 2
- New methods for 3-SAT decision and worst-case analysis
- On cliques in graphs
- On computing a longest path in a tree
- On improved exact algorithms for \(L(2,1)\)-labeling of graphs
- Regular codes in regular graphs are difficult
- Relations between packing and covering numbers of a tree
- Star coloring of sparse graphs
- The $L(2,1)$-Labeling Problem on Graphs
Cited in
(9)- Graphs with unique maximum packing of closed neighborhoods
- (Open) packing number of some graph products
- scientific article; zbMATH DE number 554182 (Why is no real title available?)
- Incidence dimension and 2-packing number in graphs
- On 2-limited packings of complete grid graphs
- On Two Conjectures on Packing of Graphs
- Partial packing coloring and quasi-packing coloring of the triangular grid
- The d-distance p-packing domination number: complexity, cycles, and trees
- Perfect Roman domination: aspects of enumeration and parameterization
This page was built for publication: On the number of 2-packings in a connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761463)