On the volume of -way S(K₁,3)-trade on (3, 6)-fullerene graphs
From MaRDI portal
Publication:6995397
\((3,6)\)-fullerene graph\(\mu\)-way \(G\)-trade of volume \(s\) with underlying graph \(H\)perfect star packing
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites work
- A class of Hamiltonian polytopes
- scientific article; zbMATH DE number 1146235 (Why is no real title available?)
- scientific article; zbMATH DE number 1522751 (Why is no real title available?)
- On the possible volumes of \(\mu\)-way Latin trades
- On the simultaneous edge-coloring conjecture
- On the volume of -way G-trade
- Packing stars in fullerenes
- Shortest perfect pseudomatchings in fullerene graphs
- The complete enumeration of triad systems in 15 elements.
- The trade-off method in the construction of BIB designs with variable support sizes
- Trades and graphs
This page was built for publication: On the volume of \(\mu\)-way \(S(K_{1,3})\)-trade on \((3, 6)\)-fullerene graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995397)