On graphs with equal edge connectivity and minimum degree (Q1134165): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Approach to a Communications Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal edge-connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies on directed graphs. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079637 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(79)90139-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081631658 / rank
 
Normal rank

Latest revision as of 09:56, 30 July 2024

scientific article
Language Label Description Also known as
English
On graphs with equal edge connectivity and minimum degree
scientific article

    Statements

    On graphs with equal edge connectivity and minimum degree (English)
    0 references
    0 references
    1979
    0 references
    minimum degree of a graph
    0 references
    edge connectivity
    0 references

    Identifiers