Non saturated polyhexes and polyiamonds

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil
2018 International Conference on Random and Exhaustive Generation of Combinatorial Structures  
Induced subtrees of a graph G are induced subgraphs of G that are trees. Fully leafed induced subtrees of G have the maximal number of leaves among all induced subtrees of G. In this extended abstract we are investigating the enumeration of a particular class of fully leafed induced subtrees that we call non saturated. After an overview of this recent subject, we proceed to the enumeration of fixed non saturated polyhexes and polyiamonds.
dblp:conf/gascom/MasseCG18 fatcat:wlf7nubzoneajkbmgnaiedlvqe