|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 4 of 14 found articles
| Title: |
Bipartite embedding of (p,q)-trees |
| Author: |
Beata Orchel |
| Appeared in: |
Opuscula mathematica |
| Paging: | Volume 26 (2006) nr. 1 pages 119-125 |
| Year: |
2006 |
| Contents: |
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. |
| Publisher: |
AGH University of Science and Technology (provided by DOAJ) |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 4 of 14 found articles
| << previous | next >> |