Spanning 3-connected index of graphs
From MaRDI portal
Publication:2436658
DOI10.1007/s10878-012-9583-7zbMath1286.90160OpenAlexW2156253131MaRDI QIDQ2436658
Zhao Zhang, Wei Xiong, Hong-Jian Lai
Publication date: 25 February 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9583-7
Related Items (6)
A diagnosis algorithm by using graph-coloring under the PMC model ⋮ Supereulerian width of dense graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ Unnamed Item ⋮ Panconnected index of graphs ⋮ On the extended Clark-Wormold Hamiltonian-like index problem
Cites Work
- On the spanning connectivity of graphs
- Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
- On the spanning connectivity and spanning laceability of hypercube-like networks
- On the Hamiltonian index
- \(s\)-vertex pancyclic index
- The super-connected property of recursive circulant graphs
- On spanning disjoint paths in line graphs
- A reduction method to find spanning Eulerian subgraphs
- A group-theoretic model for symmetric interconnection networks
- Connectivity of iterated line graphs
- Connectivity of iterated line graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Spanning 3-connected index of graphs