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

DOI10.7151/DMGT.1724zbMATH Open1292.05150OpenAlexW2072112378MaRDI QIDQ5405282FDOQ5405282

Authors: 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

Recommendations

• On 4-\(\gamma_c\)-critical graphs with cut-vertices
• scientific article; zbMATH DE number 2108137
• scientific article; zbMATH DE number 1933044
• The structure of \(4-\gamma \)-critical graphs with a cut vertex
• On the number of cut-vertices in a graph
• ASYMPTOTIC NUMBERS OF GENERAL 4-REGULAR GRAPHS WITH GIVEN CONNECTIVITIES
• On Domination Number of 4-Regular Graphs
• scientific article; zbMATH DE number 5656434
• 4-cordiality of some regular graphs and the complete 4-partite graph
• Blocks and cut vertices of the Buneman graph

zbMATH Keywords

claw-free4-regular graphcut-verticesend-blocks

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• An extremal problem in graph theory
• Title not available (Why is that?)
• The number of cutvertices in graphs with given minimum degree
• The number of cut-vertices in a graph of given minimum degree
• Title not available (Why is that?)

Cited In (3)

• On triangle-free regular graphs containing a cut vertex
• The number of blocks of a graph with given minimum degree
• Upper bounds for some graph invariants in terms of blocks and cut-vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405282)