Bipartite embedding of (p,q)-trees
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'\). I...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
AGH Univeristy of Science and Technology Press
2006-01-01
|
| Sarja: | Opuscula Mathematica |
| Aiheet: | |
| Linkit: | http://www.opuscula.agh.edu.pl/vol26/1/art/opuscula_math_2607.pdf |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|