A note on minimum graphs with girth pair (4, 2l + 1)

Denis Hanson, Ping Wang, Gary MacGillivrayJournal of Graph Theory 1994 · DOI

Abstract

Abstract We show that the size of a smallest connected k ‐regular graph with girth pair (4, 2 l + 1) is within a constant of (2 l + 1) k /2. In so doing we disprove a conjecture of Harary and Kovacs.
BibTeX
@article{hanson1994note,
  author = {Denis Hanson and Ping Wang and Gary MacGillivray},
  title = {{A note on minimum graphs with girth pair (4, 2<i>l</i> + 1)}},
  journal = {Journal of Graph Theory},
  year = {1994},
  doi = {10.1002/jgt.3190180403},
}

Loading related content...

Figure