Note on the connectivity of line graphs
From MaRDI portal
Publication:2390273
DOI10.1016/j.ipl.2004.03.013zbMath1178.68088MaRDI QIDQ2390273
Dieter Rautenbach, Angelika Hellwig, Lutz Volkmann
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.013
68R10: Graph theory (including graph drawing) in computer science
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Completely independent spanning trees in line graphs, On reliability of the folded hypercubes, Maximally edge-connected and vertex-connected graphs and digraphs: A survey, The existence and upper bound for two types of restricted connectivity, Super connectivity of line graphs, Super-connected but not super edge-connected graphs, Fault-tolerant analysis of a class of networks
Cites Work
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Cuts leaving components of given minimum order
- Edge-cuts leaving components of order at least three
- The connectivity of line-graphs
- Lower-bounds on the connectivities of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item