On Vertex-Edge-Critically <i>n</i>-Connected Graphs (Q4305320): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-minimally n-edge-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Faktoren von Graphen. (1-factors of graphs) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:47, 22 May 2024

scientific article; zbMATH DE number 638335
Language Label Description Also known as
English
On Vertex-Edge-Critically <i>n</i>-Connected Graphs
scientific article; zbMATH DE number 638335

    Statements

    On Vertex-Edge-Critically <i>n</i>-Connected Graphs (English)
    0 references
    0 references
    8 March 1995
    0 references
    connectivity number
    0 references
    digraphs
    0 references
    connectivity
    0 references
    vertex-edge-critical digraph
    0 references

    Identifiers