A convexity lemma and expansion procedures for bipartite graphs
Publikationen: Beitrag in Fachzeitschrift › Artikel › Forschung › (peer-reviewed)
Standard
in: European journal of combinatorics , Jahrgang 19, Nr. 6, 08.1998, S. 677-685.
Publikationen: Beitrag in Fachzeitschrift › Artikel › Forschung › (peer-reviewed)
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - A convexity lemma and expansion procedures for bipartite graphs
AU - Imrich, Wilfried
AU - Klavžar, Sandi
PY - 1998/8
Y1 - 1998/8
UR - http://www.scopus.com/inward/record.url?scp=0041940682&partnerID=8YFLogxK
U2 - 10.1006/eujc.1998.0229
DO - 10.1006/eujc.1998.0229
M3 - Article
AN - SCOPUS:0041940682
VL - 19
SP - 677
EP - 685
JO - European journal of combinatorics
JF - European journal of combinatorics
SN - 0195-6698
IS - 6
ER -