Almost All Graphs with 1.44n Edges are 3-Colorable

@article{Chvtal1991AlmostAG,
  title={Almost All Graphs with 1.44n Edges are 3-Colorable},
  author={Vasek Chv{\'a}tal},
  journal={Random Struct. Algorithms},
  year={1991},
  volume={2},
  pages={11-28}
}
Highly Cited
This paper has 64 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

64 Citations

0510'92'98'05'12'19
Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.