Opuscula Math. 28, no. 3 (2008), 223-231

 
Opuscula Mathematica

3-biplacement of bipartite graphs

Lech Adamus
Edyta Leśniak
Beata Orchel

Abstract. Let \(G=(L,R;E)\) be a bipartite graph with color classes \(L\) and \(R\) and edge set \(E\). A set of two bijections \(\{\varphi_1 , \varphi_2\}\), \(\varphi_1 , \varphi_2 :L \cup R \to L \cup R\), is said to be a \(3\)-biplacement of \(G\) if \(\varphi_1(L)= \varphi_2(L) = L\) and \(E \cap \varphi_1^*(E)=\emptyset\), \(E \cap \varphi_2^*(E)=\emptyset\), \(\varphi_1^*(E) \cap \varphi_2^*(E)=\emptyset\), where \(\varphi_1^*\), \(\varphi_2^*\) are the maps defined on \(E\), induced by \(\varphi_1\), \(\varphi_2\), respectively. We prove that if \(|L| = p\), \(|R| = q\), \(3 \leq p \leq q\), then every graph \(G=(L,R;E)\) of size at most \(p\) has a \(3\)-biplacement.

Keywords: bipartite graph, packing of graphs, placement, biplacement.

Mathematics Subject Classification: 05C70.

Full text (pdf)

  • Lech Adamus
  • AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Cracow, Poland
  • Edyta Leśniak
  • Beata Orchel
  • AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Cracow, Poland
  • Received: 2007-09-25.
  • Revised: 2008-02-15.
  • Accepted: 2008-03-01.
Opuscula Mathematica - cover

Cite this article as:
Lech Adamus, Edyta Leśniak, Beata Orchel, 3-biplacement of bipartite graphs, Opuscula Math. 28, no. 3 (2008), 223-231

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.