The spanning connectivity of line graphs
From MaRDI portal
Publication:548422
DOI10.1016/j.aml.2011.04.013zbMath1219.05083OpenAlexW2088654300MaRDI QIDQ548422
Publication date: 28 June 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.04.013
Related Items (8)
Packing spanning trees in highly essentially connected graphs ⋮ On spanning disjoint paths in line graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Degree sequence conditions for a graph to be disjoint path coverable ⋮ On the spanning connectivity of tournaments ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Complete family reduction and spanning connectivity in line graphs
Cites Work
- Unnamed Item
- The super connectivity of the pancake graphs and the super laceability of the star graphs
- On hamiltonian line graphs and connectivity
- On \(s\)-Hamiltonian-connected line graphs
- Edge-connectivity and edge-disjoint spanning trees
- On the spanning fan-connectivity of graphs
- The reduction of graph families closed under contraction
- On a closure concept in claw-free graphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- On spanning connected graphs
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Hamiltonian results inK1,3-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Supereulerian graphs: A survey
- Reflections on graph theory
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: The spanning connectivity of line graphs
