The numbers of cut-vertices and end-blocks in 4-regular graphs
From MaRDI portal
Publication:5405282
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
Cites work
- scientific article; zbMATH DE number 3501540 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1933044 (Why is no real title available?)
- An extremal problem in graph theory
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- The number of cut-vertices in a graph of given minimum degree
- The number of cutvertices in graphs with given minimum degree
Cited in
(3)
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)