Article ID Journal Published Year Pages File Type
4649375 Discrete Mathematics 2009 7 Pages PDF
Abstract

In this paper we give optimal vertex degree conditions that guarantee connection by short paths in εε-regular bipartite graphs. We also study a related question of decomposing an arbitrary graph into subgraphs of small diameter.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Short paths in εε-regular pairs and small diameter decompositions of dense graphs
Authors
, ,