Explicit construction of graphs with an arbitrary large girth and of large size
- 1 June 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 60 (1-3) , 275-284
- https://doi.org/10.1016/0166-218x(94)00058-l
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Cycles of even length in graphsPublished by Elsevier ,2004
- An improvement on the Erdős bound for graphs of girth 16Contemporary Mathematics, 1995
- New Examples of Graphs without Small Cycles and of Large SizeEuropean Journal of Combinatorics, 1993
- Extremal graphs with no C4's, C6's, or C10'sJournal of Combinatorial Theory, Series B, 1991
- Constructing random-like graphsProceedings of Symposia in Applied Mathematics, 1991
- Note on the girth of Ramanujan graphsJournal of Combinatorial Theory, Series B, 1990
- Ramanujan graphsCombinatorica, 1988
- Girths of bipartite sextet graphsCombinatorica, 1984
- Extremal graph theoryDiscrete Mathematics, 1979
- Minimal Regular Graphs of Girths Eight and TwelveCanadian Journal of Mathematics, 1966