Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
type: Item
instance of: scholarly article
title: Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
zbMATH Open document ID: 0455.05038
DOI: 10.1016/0166-218X(81)90023-8
author: F. T. Boesch
author: Charles L. Suffel
published in: Discrete Applied Mathematics
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 3711997
zbMATH Keywords: graph realizability
zbMATH Keywords: maximum degree
zbMATH Keywords: minimum degree
zbMATH Keywords: point-connectivity
MaRDI profile type: Publication
cites work: Synthesis of reliable networks - a survey
cites work: Lower bounds on the vulnerability of a graph
cites work: On minimum multigraphs with prescribed lower bounds on local line connectivities
cites work: A Generalization of Line Connectivity and Optimally Invulnerable Graphs
cites work: A general class of invulnerable graphs
cites work: On the Invulnerability of the Regular Complete k-Partite Graphs
cites work: Line removal algorithms for graphs and their degree lists
cites work: Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity
cites work: Q4766894
cites work: Parallel concepts in graph theory
cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH
Wikidata QID: Q126551904
description: scientific article; zbMATH DE number 3711997