The number of cut-vertices in a graph of given minimum degree (Q1176737): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The number of cutvertices in graphs with given minimum degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of cut-vertices in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4083716 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extremal problem in graph theory / rank | |||
Normal rank |
Latest revision as of 09:59, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of cut-vertices in a graph of given minimum degree |
scientific article |
Statements
The number of cut-vertices in a graph of given minimum degree (English)
0 references
25 June 1992
0 references
cut-vertices
0 references
minimum degree
0 references
bound
0 references