A necessary and sufficient condition for a graph to be edge tenacious

DOI10.1016/S0012-365X(00)00400-3zbMath0984.05051OpenAlexW1969240536WikidataQ127098063 ScholiaQ127098063MaRDI QIDQ5936066

Zhiping Wang, Lian-Chang Zhao

Publication date: 14 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00400-3

zbMATH Keywords

connectivityedge-tenacious

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

On edge-rupture degree of graphs

This page was built for publication: A necessary and sufficient condition for a graph to be edge tenacious