3-biplacement of bipartite graphs

• Autorzy: Adamus L. , Leśniak E. , Orchel B.
• Języki publikacji: EN

Abstrakty

EN

Let G = (L,R;E) be a bipartite graph with color classes L and R and edge set E. A set of two bijections {φ1, φ2}, φ1, φ2 : L ∪ R → L ∪ R, is said to be a 3-biplacement of G if [formula], where φ*/1, φ*/2 are the maps defined on E, induced by φ1, φ2, respectively. We prove that if ‌L‌ = p, ‌R‌ = q, 3 ≤ p ≤ q, then every graph G = (L, R; E) of size at most p has a 3-biplacement.

Słowa kluczowe

EN

bipartite graph; packing of graphs; placement; biplacement

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2008
• Tom: Vol. 28, no. 3
• Strony: 223--231
• Opis fizyczny: Bibliogr. 5 poz., rys.

Twórcy

autor

Adamus L.

autor

Leśniak E.

autor

Orchel B.

• AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Cracow, Poland,

Bibliografia

• [1] B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
• [2] J.L. Fouquet, A.P. Wojda, Mutual placement of bipartite graphs, Discrete Math. 121 (1993), 85-92.
• [3] N. Sauer, J. Spencer, Edge disjoint placement of graphs, J. Combin. Theory Ser. B 25 (1978), 295-302.
• [4] M. Woźniak, Packing of graphs, Dissertationes Mathematicae CCCLXII, Warszawa, 1997.
• [5] M. Woźniak, A.P. Wojda, Triple placement of graphs, Graph Combin. 9 (1993), 85-91.