CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On some extremal connectivity results for graphs and matroids
Authors
James G. Oxley
Publication date
1 January 1982
Publisher
LSU Digital Commons
Doi
Cite
Abstract
Dirac and Halin have shown for n = 2 and n = 3 respectively that a minimally n-connected graph G has at least ((n-1)|V(G)|-2n)/(2n-1) vertices of degree n. This paper determines the graphs which are extremal with respect to these two results and, in addition, establishes a similar extremal result for minimally connected matroids. © 1982
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Louisiana State University
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:repository.lsu.edu:mathema...
Last time updated on 26/10/2023
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/06/2019
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/05/2017