Abstract
A perfect pseudomatching M in a graph G is a spanning subgraph of G whose components are isomorphic to the star K1,3 or to K2. Perfect pseudomatchings interpolate between perfect matchings, in which all components are K2, and perfect star packings, in which all components are stars K1,3. In this contribution we present some results on perfect pseudomatchings with small number of components in some classes of fullerene graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
