The leaf function of Penrose P2 graphs
From MaRDI portal
Cites work
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Aperiodic order. Volume 1. A mathematical invitation
- Binary tiling quasicrystals and matching rules
- Fully leafed induced subtrees
- Fully leafed tree-like polyominoes and polycubes
- HBS tilings extended: state of the art and novel observations
- scientific article; zbMATH DE number 768067 (Why is no real title available?)
- scientific article; zbMATH DE number 6282146 (Why is no real title available?)
- Minimal spanning trees with a constraint on the number of leaves
- On the snake in the box problem
- Saturated fully leafed tree-like polyforms and polycubes
This page was built for publication: The leaf function of Penrose P2 graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257269)