Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the number of cut-vertices in a graph

From MaRDI portal
Publication:1123210
Jump to:navigation, search

DOI10.1155/S0161171289000359zbMath0677.05047OpenAlexW2027119806MaRDI QIDQ1123210

S. H. Smith

Publication date: 1989

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/46391


zbMATH Keywords

boundscut-vertices


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)


Related Items (2)

The number of blocks of a graph with given minimum degree ⋮ The number of cut-vertices in a graph of given minimum degree







This page was built for publication: On the number of cut-vertices in a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1123210&oldid=13176041"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki