Subgraf indus (Romanian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Subgraf indus" in Romanian language version.
refsWebsite
Global rank
Romanian rank
3rd place
6th place
43rd place
2nd place
ams.org
- Howorka, Edward (), „A characterization of distance-hereditary graphs”, The Quarterly Journal of Mathematics, Second Series, 28 (112), pp. 417–420, doi:10.1093/qmath/28.4.417, MR 0485544.
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (), „The strong perfect graph theorem”, Annals of Mathematics(d), 164 (1), pp. 51–229, arXiv:math/0212070
, doi:10.4007/annals.2006.164.51, MR 2233847. - Johnson, David S. (), „The NP-completeness column: an ongoing guide”, Journal of Algorithms, 6 (3), pp. 434–451, doi:10.1016/0196-6774(85)90012-4, MR 0800733.
arxiv.org
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (), „The strong perfect graph theorem”, Annals of Mathematics(d), 164 (1), pp. 51–229, arXiv:math/0212070 , doi:10.4007/annals.2006.164.51, MR 2233847.
books.google.com
- Diestel, Reinhard (), Graph Theory, Graduate texts in mathematics, 173, Springer-Verlag, pp. 3–4, ISBN 9783540261834.
doi.org
- Howorka, Edward (), „A characterization of distance-hereditary graphs”, The Quarterly Journal of Mathematics, Second Series, 28 (112), pp. 417–420, doi:10.1093/qmath/28.4.417, MR 0485544.
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (), „The strong perfect graph theorem”, Annals of Mathematics(d), 164 (1), pp. 51–229, arXiv:math/0212070 , doi:10.4007/annals.2006.164.51, MR 2233847.
- Johnson, David S. (), „The NP-completeness column: an ongoing guide”, Journal of Algorithms, 6 (3), pp. 434–451, doi:10.1016/0196-6774(85)90012-4, MR 0800733.
wikidata.org
- Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (), „The strong perfect graph theorem”, Annals of Mathematics(d), 164 (1), pp. 51–229, arXiv:math/0212070 , doi:10.4007/annals.2006.164.51, MR 2233847.