1-join composition for $\alpha$-critical graphs

Carlos E. Valencia, Marcos I. Barrita

Given two graphs G and H its 1-{\it join} is the graph obtained by taking the disjoint union of G and H and adding all the edges between a nonempty subset of vertices of G and a no…