The numbers of cut-vertices and end-blocks in 4-regular graphs

DOI10.7151/dmgt.1724zbMath1292.05150OpenAlexW2072112378MaRDI QIDQ5405282

Dingguo Wang, Erfang Shan

Publication date: 2 April 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1724

zbMATH Keywords

4-regular graphclaw-freecut-verticesend-blocks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

The number of blocks of a graph with given minimum degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of cutvertices in graphs with given minimum degree
• The number of cut-vertices in a graph of given minimum degree
• An extremal problem in graph theory
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree

This page was built for publication: The numbers of cut-vertices and end-blocks in 4-regular graphs