A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Graphs and digraphs with given girth and connectivity
1994
Discrete Mathematics
Preserved Fulltext
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).
doi:10.1016/0012-365x(92)00576-d
fatcat:q5bng32ybzaozap2crxrcfeke4