On the spanningw-wide diameter of the star graph

DOI10.1002/net.20135zbMath1107.05055OpenAlexW4255991146MaRDI QIDQ3418210

Lih-Hsing Hsu, Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20135

zbMATH Keywords

containerwidthdisjoint paths

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Property P_d,m and efficient design of reliable networks ⋮ Panpositionable hamiltonicity and panconnectivity of the arrangement graphs ⋮ On the spanning connectivity of tournaments ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ On the spanning fan-connectivity of graphs ⋮ Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs

This page was built for publication: On the spanningw-wide diameter of the star graph