The packing number of cubic graphs

DOI10.1016/J.DISOPT.2024.100850MaRDI QIDQ6602335zbMATH OpenFDO

Authors Wayne Goddard, Michael A. Henning

Publication date 11 September 2024

Published in Discrete Optimization (Search for Journal in Brave)

zbMATH Keywords

optimizationboundscubic graphpacking number

Mathematics Subject Classification ID

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

Recommendations

• Packing in regular graphs
• Packing three-vertex paths in 2-connected cubic graphs.
• Packing three-vertex paths in a subcubic graph
• scientific article; zbMATH DE number 637534
• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices

Cites work

• scientific article; zbMATH DE number 3675940 (Why is no real title available?)
• A new lower bound on the independence number of a graph and applications
• Limited packings in graphs
• Packing in regular graphs
• Signed domination in regular graphs
• Vertex colorings without rainbow subgraphs

Cited in

(1)

• The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices

This page was built for publication: The packing number of cubic graphs

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