BibTeX record journals/cpc/DiarmidR95

download as .bib file

@article{DBLP:journals/cpc/DiarmidR95,
  author       = {Colin McDiarmid and
                  Bruce A. Reed},
  title        = {Almost Every Graph can be Covered by [fracDelta2] Linear Forests},
  journal      = {Comb. Probab. Comput.},
  volume       = {4},
  pages        = {257--268},
  year         = {1995},
  url          = {https://doi.org/10.1017/S0963548300001632},
  doi          = {10.1017/S0963548300001632},
  timestamp    = {Thu, 12 Mar 2020 15:55:34 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/DiarmidR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.