Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Recommendations
Cites work
- scientific article; zbMATH DE number 2119734 (Why is no real title available?)
- A Generalized Parity Function and Its Use in the Construction of Perfect Codes
- An extension of Tutte's 1-factor theorem
- On the completeness of a generalized matching problem
- Optimal packing of induced stars in a graph
- Packing almost stars into the complete graph
- Packing lines in a hypercube
- Packing of graphs - a survey
Cited in
(11)- The fullerene graphs with a perfect star packing
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
- Packing of hexagonal networks
- Packing of certain nanotubes and nanosheet
- Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
- Honeycomb arrays
- Domination in certain chemical graphs
- Spectrum of a dilated honeycomb network
- scientific article; zbMATH DE number 6002502 (Why is no real title available?)
- Domination parameters in coronene torus network
- Block allocation of a sequential resource
This page was built for publication: Packing in honeycomb networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714696)
