Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity (Q1149964): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the vulnerability of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum multigraphs with prescribed lower bounds on local line connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Line Connectivity and Optimally Invulnerable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of invulnerable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Invulnerability of the Regular Complete <i>k</i>-Partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line removal algorithms for graphs and their degree lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of <i>p</i>‐point graphs with prescribed minimum degree, maximum degree, and line connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank
 
Normal rank

Revision as of 11:40, 13 June 2024

scientific article
Language Label Description Also known as
English
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity
scientific article

    Statements

    Identifiers