Packing in regular graphs
From MaRDI portal
Publication:5375889
DOI10.2989/16073606.2017.1398193zbMATH Open1395.05132OpenAlexW2767892248MaRDI QIDQ5375889FDOQ5375889
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
Recommendations
Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- A new lower bound on the independence number of a graph and applications
- Total Domination in Graphs
- On Moore Graphs with Diameters 2 and 3
- Maximum degree in graphs of diameter 2
- Title not available (Why is that?)
- Relations between packing and covering numbers of a tree
- Independence, clique size and maximum degree
- Signed domination in regular graphs
- Title not available (Why is that?)
- There is No Irregular Moore Graph
- COVERING AND PACKING IN GRAPHS, I.
- Title not available (Why is that?)
- Structural properties of graphs of diameter 2 and defect 2
- A Taxonomy of Perfect Domination
- Graphs of diameter 2 with cyclic defect
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Packing smaller graphs into a graph
- The packing number of cubic graphs
- Further results on the independent Roman domination number of graphs
- Packing constants in graphs and connectivity
- 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)
