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

The connected cutset connectivity of a graph

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

DOI10.1016/0012-365X(88)90058-1zbMath0643.05044MaRDI QIDQ1101465

Ortrud R. Oellermann

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

minimum degreeedge-connectivity


Mathematics Subject Classification ID

Connectivity (05C40)


Related Items (1)

Computation in Causal Graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • On graphs with equal edge-connectivity and minimum degree
  • Results on the edge-connectivity of graphs
  • A sufficient condition for equality of edge-connectivity and minimum degree of a graph
  • A Graph-Theoretic Approach to a Communications Problem
  • Critically n-Connected Graphs


This page was built for publication: The connected cutset connectivity of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1101465&oldid=13134713"
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 02:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki