Information Processing Letters

Paper

24 Jul 1992

On independent spanning trees

View publication

Abstract

We prove that if any k-vertex connected graph has k vertex independent spanning trees, then any k-edge connected graph has k edge independent spanning trees. Thus, answering a question raised by Zehavi and Itai [J. Graph Theory 13 (1989)] in the affirmative. © 1992.

Related

Paper

On convex relaxations of quadrilinear terms

Sonia Cafieri, Jon Lee, et al.

Journal of Global Optimization

Conference paper

Modeling polarization for Hyper-NA lithography tools and masks

Kafai Lai, Alan E. Rosenbluth, et al.

SPIE Advanced Lithography 2007

Conference paper

Better on wafer performance and mask manufacturability of contacts with no or non-traditional serifs

Donald Samuels, Ian Stobert

SPIE Photomask Technology + EUV Lithography 2007

Conference paper

Performance measurement and data base design

Alfonso P. Cardenas, Larry F. Bowman, et al.

ACM Annual Conference 1975

View all publications