2-placement of (p,q)-trees

@article{BeataOrchel2003,
abstract = { Let G = (L,R;E) be a bipartite graph such that V(G) = L∪R, |L| = p and |R| = q. G is called (p,q)-tree if G is connected and |E(G)| = p+q-1. Let G = (L,R;E) and H = (L',R';E') be two (p,q)-tree. A bijection f:L ∪ R → L' ∪ R' is said to be a biplacement of G and H if f(L) = L' and f(x)f(y) ∉ E' for every edge xy of G. A biplacement of G and its copy is called 2-placement of G. A bipartite graph G is 2-placeable if G has a 2-placement. In this paper we give all (p,q)-trees which are not 2-placeable. },
author = {Beata Orchel},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {tree; bipartite graph; packing graph},
language = {eng},
number = {1},
pages = {23-36},
title = {2-placement of (p,q)-trees},
url = {http://eudml.org/doc/270503},
volume = {23},
year = {2003},
}

TY - JOUR
AU - Beata Orchel
TI - 2-placement of (p,q)-trees
JO - Discussiones Mathematicae Graph Theory
PY - 2003
VL - 23
IS - 1
SP - 23
EP - 36
AB - Let G = (L,R;E) be a bipartite graph such that V(G) = L∪R, |L| = p and |R| = q. G is called (p,q)-tree if G is connected and |E(G)| = p+q-1. Let G = (L,R;E) and H = (L',R';E') be two (p,q)-tree. A bijection f:L ∪ R → L' ∪ R' is said to be a biplacement of G and H if f(L) = L' and f(x)f(y) ∉ E' for every edge xy of G. A biplacement of G and its copy is called 2-placement of G. A bipartite graph G is 2-placeable if G has a 2-placement. In this paper we give all (p,q)-trees which are not 2-placeable.
LA - eng
KW - tree; bipartite graph; packing graph
UR - http://eudml.org/doc/270503
ER -