The block graph of a graph G, written B(G), is the graph whose vertices are the blocks of G and in which two vertices are adjacent whenever the corresponding blocks have a cutvertex in common. We study the properties of B(G) and present the characterization of graphs whose B(G) are planar, outerplanar, maximal outerplanar, minimally nonouterplanar, Eulerian, and Hamiltonian. A necessary and sufficient condition for B(G) to have crossing number one is also presented.
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.