Packing bipartite graphs
type: Item
instance of: scholarly article
title: Packing bipartite graphs
zbMATH Open document ID: 0872.05046
DOI: 10.1016/S0012-365X(96)00065-9
author: Paul Vaderlind
author: Adam Paweł Wojda
published in: Discrete Mathematics
publication date: 1997-06-10T00:00:00Z
review text: Consider two bipartite graphs \(G=\{L,R,E\}\) and \(G'=\{L',R',E'\}\). A bijection \(f:L\cup R\to L'\cup R'\) such that \(f(L)=L'\) and \(f(u)f(v)\not\in E'\) for every edge \(uv\in E\) is called a bi-placement of \(G\) and \(G'\). The graphs \(G\) and \(G'\) are called bi-placeable if there exists a bi-placement of \(G\) and \(G'\). The authors present new sufficient conditions for bipartite graphs \(G\) and \(G'\) to be bi-placeable. For the case when all vertices of \(R\) and \(R'\) are isolated or pendent, the authors go on to present a necessary and sufficient condition for \(G\) and \(G'\) to be bi-placeable.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1019076
zbMATH Keywords: packing
zbMATH Keywords: bipartite graphs
reviewed by: D. V. Chopra
MaRDI profile type: Publication
cites work: Advances in graph theory
cites work: Subgraphs of graphs. I
cites work: Mutual placement of bipartite graphs
cites work: Transversal theory. An account of some aspects of combinatorial mathematics
cites work: A Theorem on General Measure Functions
cites work: Q3715121
full work available at URL: s0012-365x(96)00065-9
OpenAlex ID: W2017002372
description: scientific article; zbMATH DE number 1019076