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

Approximation algorithms for VRP with stochastic demands

Anupam Gupta, Viswanath Nagarajan, et al.

Operations Research

Conference paper

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Frank R. Libsch, Takatoshi Tsujimura

Active Matrix Liquid Crystal Displays Technology and Applications 1997

Conference paper

Low-Resource Speech Recognition of 500-Word Vocabularies

Sabine Deligne, Ellen Eide, et al.

INTERSPEECH - Eurospeech 2001

Conference paper

A quantitative analysis of OS noise

Alessandro Morari, Roberto Gioiosa, et al.

IPDPS 2011

View all publications