On the packing number of generalized Petersen graphs P(n,2).

MaRDI QIDQ4909678zbMATH OpenFDO

Authors Yuansheng Yang, Xueliang Fu, Baoqi Jiang

Publication date 21 March 2013

zbMATH Keywords

generalized Petersen graphpackingpacking number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Packing in regular graphs
• Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph
• Packing in trees
• (Open) packing number of some graph products
• Packing graphs: The packing problem solved

Cited in

(4)

• 2-rainbow domination of generalized Petersen graphs P(n,2)
• The packing number of the double vertex graph of the path graph
• scientific article; zbMATH DE number 734474 (Why is no real title available?)
• Packing in regular graphs

This page was built for publication: On the packing number of generalized Petersen graphs \(P(n,2)\).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909678)