Elsevier

Discrete Mathematics

Volume 132, Issues 1–3, 15 September 1994, Pages 387-390
Discrete Mathematics

Note
Graphs and digraphs with given girth and connectivity

https://doi.org/10.1016/0012-365X(92)00576-DGet rights and content
Under an Elsevier user license
open archive

Abstract

In this paper, we show that for any given two positive integers g and k with g⩾3, there exists a graph (digraph) G with girth g and connectivity k. Applying this result, we give a negative answer to the problem proposed by M. Junger, G. Reinelt and W.R. Pulleyblank (1985).

Cited by (0)