A convexity lemma and expansion procedures for bipartite graphs

Research output: Contribution to journalArticleResearchpeer-review

Standard

A convexity lemma and expansion procedures for bipartite graphs. / Imrich, Wilfried; Klavžar, Sandi.
In: European journal of combinatorics , Vol. 19, No. 6, 08.1998, p. 677-685.

Research output: Contribution to journalArticleResearchpeer-review

Vancouver

Bibtex - Download

@article{dd3f3a9175c0430f89945dc7f0441fd2,
title = "A convexity lemma and expansion procedures for bipartite graphs",
author = "Wilfried Imrich and Sandi Klav{\v z}ar",
year = "1998",
month = aug,
doi = "10.1006/eujc.1998.0229",
language = "English",
volume = "19",
pages = "677--685",
journal = "European journal of combinatorics ",
issn = "0195-6698",
publisher = "Academic Press Inc.",
number = "6",

}

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 -