ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Mathematicae Graph Theory 23(1) (2003) 23-36DOI: 10.7151/dmgt.1183
University of Mining and Metallurgy
Al. Mickiewicza 30
30-059 Kraków, Poland
Let G = (L,R;E) and H = (L′,R′;E′)
be two (p,q)-tree. A bijection f: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.
Keywords: tree, bipartite graph, packing graph.
2000 Mathematics Subject Classification: 05C35.
Received 19 December 2000
Revised 7 March 2002