| Original language | English |
|---|---|
| Pages (from-to) | 97-110 |
| Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
| Volume | 17 |
| Publication status | Published - 1995 |
Cite this
Vijayan, K., Budayasa, K., & Caccetta, L. (1995). On critically k-edge connected graphs with prescribed size. Journal of Combinatorial Mathematics and Combinatorial Computing, 17, 97-110.
@article{ba10799e916648c58cac074b18a097c7,
title = "On critically k-edge connected graphs with prescribed size",
author = "Kaipillil Vijayan and K. Budayasa and L. Caccetta",
year = "1995",
language = "English",
volume = "17",
pages = "97--110",
journal = "Journal of Combinatorial Mathematics and Combinatorial Computing",
issn = "0835-3026",
publisher = "Charles Babbage Research Centre",
}
Vijayan, K, Budayasa, K & Caccetta, L 1995, 'On critically k-edge connected graphs with prescribed size' Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 17, pp. 97-110.
On critically k-edge connected graphs with prescribed size. / Vijayan, Kaipillil; Budayasa, K.; Caccetta, L.
In: Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 17, 1995, p. 97-110.Research output: Contribution to journal › Article
TY - JOUR
T1 - On critically k-edge connected graphs with prescribed size
AU - Vijayan, Kaipillil
AU - Budayasa, K.
AU - Caccetta, L.
PY - 1995
Y1 - 1995
M3 - Article
VL - 17
SP - 97
EP - 110
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
SN - 0835-3026
ER -
Vijayan K, Budayasa K, Caccetta L. On critically k-edge connected graphs with prescribed size. Journal of Combinatorial Mathematics and Combinatorial Computing. 1995;17:97-110.