@Article{Orchel2006,
author = "Orchel, Beata",
title = "Bipartite embedding of (p,q)-trees",
journal = "Opuscula Math.",
year = "2006",
volume = "26",
number = "1",
pages = "119--125",
doi = "http://dx.doi.org/10.7494/OpMath.2006.26.1.119",
url = "http://dx.doi.org/10.7494/OpMath.2006.26.1.119",
abstract = "A bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called 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\subseteq L'\), \(R\subseteq R'\) and \(E\subseteq E'\). In this paper we present sufficient degree conditions for a bipartite graph to contain a \((p,q)\)-tree.",
keywords = "bipartite graph, tree, embedding graph",
issn = "1232-9274"
}