Open AccessPlacing bipartite graphs of small size II
Author(s) -
Beata Orchel
Publication year - 1996
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1025
Subject(s) - mathematics , bipartite graph , combinatorics , discrete mathematics , graph
In this paper we give all pairs of non mutually placeable (p, q)bipartite graphs G and H such that 2 ≤ p ≤ q, e(H) ≤ p and e(G) + e(H) ≤ 2p + q − 1.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom