Abstract
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 cut-vertex in common. We study the properties of $B(G)$ and present the characterization of graphs whose $B(G)$ are planar, outerplanar, maximal outerplanar, minimally non-outerplanar, Eulerian, and Hamiltonian. A necessary and sufficient condition for $B(G)$ to have crossing number one is also presented.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
