Maximum Hitting for n Sufficiently Large - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Ben Barber. Maximum Hitting for n Sufficiently Large. Graphs and Combinatorics, 30(2):267-274, 2014. [doi]

@article{Barber14,
  title = {Maximum Hitting for n Sufficiently Large},
  author = {Ben Barber},
  year = {2014},
  doi = {10.1007/s00373-012-1281-9},
  url = {http://dx.doi.org/10.1007/s00373-012-1281-9},
  researchr = {https://researchr.org/publication/Barber14},
  cites = {0},
  citedby = {0},
  journal = {Graphs and Combinatorics},
  volume = {30},
  number = {2},
  pages = {267-274},
}

runs on WebDSL