BIPARTITE EMBEDDING OF (p, q)-TREES

Abstract

a (p, q)-tree if |E(G) | = p + q − 1 and G has no cycles. A bipartite graph G = (L, R; E) is a subgraph of a bipartite graph H = (L′, R′; E′) if L ⊆ L′, R ⊆ R ′ and E ⊆ E′. In this paper we present sufficient degree conditions for a bipartite graph to contain a (p, q)-tree

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://yadda.icm.edu.pl/yadda/... (external link)

http://yadda.icm.edu.pl/yadda/... (external link)

http://citeseerx.ist.psu.edu/v... (external link)