Girth in digraphs

@article{Bermond1980GirthID,
  title={Girth in digraphs},
  author={Jean-Claude Bermond and Anne Germa and Marie-Claude Heydemann and Dominique Sotteau},
  journal={Journal of Graph Theory},
  year={1980},
  volume={4},
  pages={337-341}
}
For an integer k > 2 , the best function m(n, k ) is determined such that every strong digraph of order n with at least m(n, k ) arcs contains a circuit of length k or less. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Theory , Algorithms and Applications

Jørgen Bang-Jensen, Gregory Gutin Digraphs
2007
View 9 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-5 of 5 references

l-graphes rtguliers minimaux de girth donnt

J. C. Bermond
Cuhiers du C.E.R.O., • 1975

Graphs and hypergraphs

C. Berge
1973
View 1 Excerpt

Minimal 2regular digraphs with given girth

C. J.
1973

On minimal regular digraphs with given girth

M. Behzad, G. Chartrand, C. E. Wall
Fund. Math • 1970

Wall , On minimal regular digraphs with given girth

G. Chartrand, E. C.
Fund . Math . • 1970

Similar Papers

Loading similar papers…