Note on the connectivity of line graphs (Q2390273): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of line-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-bounds on the connectivities of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts leaving components of given minimum order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a kind of restricted edge connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393241 / rank
 
Normal rank

Latest revision as of 20:02, 1 July 2024

scientific article
Language Label Description Also known as
English
Note on the connectivity of line graphs
scientific article

    Statements

    Note on the connectivity of line graphs (English)
    0 references
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    0 references
    fault tolerance
    0 references
    line graphs
    0 references
    connectivity
    0 references
    restricted edge-connectivity
    0 references
    0 references