Packing in regular graphs

DOI10.2989/16073606.2017.1398193MaRDI QIDQ5375889zbMATH OpenOpenAlexFDO

Authors Michael A. Henning, William F. Klostermeyer

Publication date 17 September 2018

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2989/16073606.2017.1398193

zbMATH Keywords

packingregular graphsMoore graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the packing number of generalized Petersen graphs \(P(n,2)\).
• Packing chromatic number of cubic graphs
• scientific article; zbMATH DE number 4049679
• Near packings of graphs
• Packing three-vertex paths in a subcubic graph

Cites work

• scientific article; zbMATH DE number 4055652 (Why is no real title available?)
• scientific article; zbMATH DE number 3675940 (Why is no real title available?)
• scientific article; zbMATH DE number 3717365 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A Taxonomy of Perfect Domination
• A new lower bound on the independence number of a graph and applications
• COVERING AND PACKING IN GRAPHS, I.
• Graphs of diameter 2 with cyclic defect
• Independence, clique size and maximum degree
• Maximum degree in graphs of diameter 2
• On Moore Graphs with Diameters 2 and 3
• Relations between packing and covering numbers of a tree
• Signed domination in regular graphs
• Structural properties of graphs of diameter 2 and defect 2
• There is No Irregular Moore Graph
• Total domination in graphs

Cited in

(9)

• scientific article; zbMATH DE number 1022391 (Why is no real title available?)
• Packing smaller graphs into a graph
• scientific article; zbMATH DE number 4127236 (Why is no real title available?)
• The packing number of cubic graphs
• Further results on the independent Roman domination number of graphs
• Packing constants in graphs and connectivity
• On the packing number of generalized Petersen graphs \(P(n,2)\).
• Vertex-edge domination in cubic graphs
• Regular packings of regular graphs

This page was built for publication: Packing in regular graphs

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