Geodesic
Block graph of a graph
Vladikavkazskij matematičeskij žurnal, Tome 21 (2019) no. 1, pp. 74-78 
A. Kelkar; K. Jaysurya; H. M. Nagesh. Block graph of a graph. Vladikavkazskij matematičeskij žurnal, Tome 21 (2019) no. 1, pp. 74-78. http://geodesic.mathdoc.fr/item/VMJ_2019_21_1_a6/
@article{VMJ_2019_21_1_a6,
     author = {A. Kelkar and K. Jaysurya and H. M. Nagesh},
     title = {Block graph of a graph},
     journal = {Vladikavkazskij matemati\v{c}eskij \v{z}urnal},
     pages = {74--78},
     year = {2019},
     volume = {21},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VMJ_2019_21_1_a6/}
}
TY  - JOUR
AU  - A. Kelkar
AU  - K. Jaysurya
AU  - H. M. Nagesh
TI  - Block graph of a graph
JO  - Vladikavkazskij matematičeskij žurnal
PY  - 2019
SP  - 74
EP  - 78
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMJ_2019_21_1_a6/
LA  - en
ID  - VMJ_2019_21_1_a6
ER  - 
%0 Journal Article
%A A. Kelkar
%A K. Jaysurya
%A H. M. Nagesh
%T Block graph of a graph
%J Vladikavkazskij matematičeskij žurnal
%D 2019
%P 74-78
%V 21
%N 1
%U http://geodesic.mathdoc.fr/item/VMJ_2019_21_1_a6/
%G en
%F VMJ_2019_21_1_a6

Voir la notice de l'article provenant de la source Math-Net.Ru

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.

[1] Harary F., Graph Theory, Addison Wesley, Reading, 1969 | MR | Zbl

[2] Harary F., “A Characterization of Block-Graphs”, Canadian Mathematical Bulletin, 6:1 (1963), 1–6 | DOI | MR | Zbl

[3] Kulli V. R., “On Minimally Nonouterplanar Graphs”, Proceeding of the Indian National Science Academy, 40 (1975), 276–280 | MR