article · Discrete Mathematics · 1994

A randomized algorithm for k-colorability

Cited by 8Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Žerovnik, J. (1994). A randomized algorithm for k-colorability. Discrete Mathematics, 131(1-3), 379–393. https://doi.org/10.1016/0012-365x(94)90402-2

MLA 9

Žerovnik, Janez. “A randomized algorithm for k-colorability.” Discrete Mathematics, vol. 131, no. 1-3, 1994, pp. 379–93, https://doi.org/10.1016/0012-365x(94)90402-2.

Chicago

Žerovnik, Janez. 1994. “A randomized algorithm for k-colorability.” Discrete Mathematics 131 (1-3): 379–93. https://doi.org/10.1016/0012-365x(94)90402-2.

Harvard

Žerovnik, J. (1994) ‘A randomized algorithm for k-colorability’, Discrete Mathematics, 131(1-3), pp. 379–393. Available at: https://doi.org/10.1016/0012-365x(94)90402-2.

BibTeX

@article{zerovnik1994randomized,
  title = {{A randomized algorithm for k-colorability}},
  author = {Žerovnik, Janez},
  journal = {Discrete Mathematics},
  volume = {131},
  number = {1-3},
  pages = {379--393},
  year = {1994},
  doi = {10.1016/0012-365x(94)90402-2}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.