Indestructive deletions of edges from graphs (Q1164646): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimale \(n\)-fach kantenzusammenhängende Graphen / 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: Kantendisjunkte Wege in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endlichkeitssätze für k-kritische Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-critical, n-connected graphs / 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: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank

Latest revision as of 14:50, 13 June 2024

scientific article
Language Label Description Also known as
English
Indestructive deletions of edges from graphs
scientific article

    Statements

    Identifiers