A construction of 3-connected graphs
We show that the 3-connected graphs can be generated from the complete graph on four vertices and the complete 3,3 bipartite graph by adding vertices and adding edges with endpoints on two edges meeting at a 3-valent vertex.
KeywordsBipartite Graph Complete Graph Multiple Edge Complete Bipartite Graph Recursive Construction
Unable to display preview. Download preview PDF.