An Optimal Labeling for Node Connectivity

DOI10.1007/978-3-642-10631-6_32zbMath1232.05202OpenAlexW1485486436MaRDI QIDQ3652218

Tai-Hsin Hsu, Hsueh-I Lu

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_32

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (5)

Better distance labeling for unweighted planar graphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ A note on labeling schemes for graph connectivity ⋮ Fault-tolerant distance labeling for planar graphs

This page was built for publication: An Optimal Labeling for Node Connectivity