Graf lengkap (Indonesian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graf lengkap" in Indonesian language version.

refsWebsite

Global rank Indonesian rank

5web.archive.org

1^st place

4doi.org

2^nd place

4^th place

3books.google.com

3^rd place

6^th place

2archive.org

6^th place

2^nd place

2arxiv.org

69^th place

207^th place

2harvard.edu

18^th place

44^th place

1bham.ac.uk

6,934^th place

low place

1worldcat.org

5^th place

7^th place

1semanticscholar.org

11^th place

330^th place

1quantamagazine.org

6,413^th place

low place

1tugraz.at

low place

1psu.edu

207^th place

525^th place

1nih.gov

4^th place

13^th place

archive.org

Pirnot, Thomas L. (2000), Mathematics All Around, Addison Wesley, hlm. 154, ISBN 9780201308150.
Gardner, Martin (1988), Time Travel and Other Mathematical Bewilderments, W. H. Freeman and Company, hlm. 140, Bibcode:1988ttom.book.....G, ISBN 0-7167-1924-X

arxiv.org

Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's Conjecture". Geometric and Functional Analysis. 31 (3): 663–720. arXiv:2001.02665. doi:10.1007/s00039-021-00576-2..
Callan, David (2009), A combinatorial survey of identities for the double factorial, arXiv:0906.1317, Bibcode:2009arXiv0906.1317C.

bham.ac.uk

pure-oai.bham.ac.uk

Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2019-08-05). "Optimal packings of bounded degree trees" (PDF). Journal of the European Mathematical Society (dalam bahasa Inggris). 21 (12): 3573–3647. doi:10.4171/JEMS/909. ISSN 1435-9855. S2CID 119315954. Diarsipkan (PDF) dari versi aslinya tanggal 2020-03-09. Diakses tanggal 2020-03-09.

books.google.com

Bang-Jensen, Jørgen; Gutin, Gregory (2018), "Basic Terminology, Notation and Results", dalam Bang-Jensen, Jørgen; Gutin, Gregory (ed.), Classes of Directed Graphs, Springer Monographs in Mathematics, Springer International Publishing, hlm. 1–34, doi:10.1007/978-3-319-71840-8_1; lihat hlm. 17 Diarsipkan 2023-08-08 di Wayback Machine.
Knuth, Donald E. (2013), "Two thousand years of combinatorics", dalam Wilson, Robin; Watkins, John J. (ed.), Combinatorics: Ancient and Modern, Oxford University Press, hlm. 7–37, ISBN 978-0191630620.
Gries, David; Schneider, Fred B. (1993), A Logical Approach to Discrete Math, Springer-Verlag, hlm. 436, ISBN 0387941150, diarsipkan dari asli tanggal 2023-08-08, diakses tanggal 2023-07-19

doi.org

Bang-Jensen, Jørgen; Gutin, Gregory (2018), "Basic Terminology, Notation and Results", dalam Bang-Jensen, Jørgen; Gutin, Gregory (ed.), Classes of Directed Graphs, Springer Monographs in Mathematics, Springer International Publishing, hlm. 1–34, doi:10.1007/978-3-319-71840-8_1; lihat hlm. 17 Diarsipkan 2023-08-08 di Wayback Machine.
Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2019-08-05). "Optimal packings of bounded degree trees" (PDF). Journal of the European Mathematical Society (dalam bahasa Inggris). 21 (12): 3573–3647. doi:10.4171/JEMS/909. ISSN 1435-9855. S2CID 119315954. Diarsipkan (PDF) dari versi aslinya tanggal 2020-03-09. Diakses tanggal 2020-03-09.
Montgomery, Richard; Pokrovskiy, Alexey; Sudakov, Benny (2021). "A proof of Ringel's Conjecture". Geometric and Functional Analysis. 31 (3): 663–720. arXiv:2001.02665. doi:10.1007/s00039-021-00576-2..
Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, CiteSeerX 10.1.1.379.8693, doi:10.1089/cmb.2005.12.1004, PMID 16201918, diarsipkan (PDF) dari versi aslinya tanggal 2017-09-21, diakses tanggal 2012-03-29.

harvard.edu

ui.adsabs.harvard.edu

Callan, David (2009), A combinatorial survey of identities for the double factorial, arXiv:0906.1317, Bibcode:2009arXiv0906.1317C.
Gardner, Martin (1988), Time Travel and Other Mathematical Bewilderments, W. H. Freeman and Company, hlm. 140, Bibcode:1988ttom.book.....G, ISBN 0-7167-1924-X

nih.gov

pubmed.ncbi.nlm.nih.gov

Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, CiteSeerX 10.1.1.379.8693, doi:10.1089/cmb.2005.12.1004, PMID 16201918, diarsipkan (PDF) dari versi aslinya tanggal 2017-09-21, diakses tanggal 2012-03-29.

psu.edu

citeseerx.ist.psu.edu

Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, CiteSeerX 10.1.1.379.8693, doi:10.1089/cmb.2005.12.1004, PMID 16201918, diarsipkan (PDF) dari versi aslinya tanggal 2017-09-21, diakses tanggal 2012-03-29.

quantamagazine.org

Hartnett, Kevin, "Rainbow Proof Shows Graphs Have Uniform Parts", Quanta Magazine (dalam bahasa Inggris), diarsipkan dari versi aslinya tanggal 2020-02-20, diakses tanggal 2020-02-20

semanticscholar.org

api.semanticscholar.org

Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2019-08-05). "Optimal packings of bounded degree trees" (PDF). Journal of the European Mathematical Society (dalam bahasa Inggris). 21 (12): 3573–3647. doi:10.4171/JEMS/909. ISSN 1435-9855. S2CID 119315954. Diarsipkan (PDF) dari versi aslinya tanggal 2020-03-09. Diakses tanggal 2020-03-09.

tugraz.at

math.tugraz.at

Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, CiteSeerX 10.1.1.379.8693, doi:10.1089/cmb.2005.12.1004, PMID 16201918, diarsipkan (PDF) dari versi aslinya tanggal 2017-09-21, diakses tanggal 2012-03-29.

web.archive.org

Bang-Jensen, Jørgen; Gutin, Gregory (2018), "Basic Terminology, Notation and Results", dalam Bang-Jensen, Jørgen; Gutin, Gregory (ed.), Classes of Directed Graphs, Springer Monographs in Mathematics, Springer International Publishing, hlm. 1–34, doi:10.1007/978-3-319-71840-8_1; lihat hlm. 17 Diarsipkan 2023-08-08 di Wayback Machine.
Gries, David; Schneider, Fred B. (1993), A Logical Approach to Discrete Math, Springer-Verlag, hlm. 436, ISBN 0387941150, diarsipkan dari asli tanggal 2023-08-08, diakses tanggal 2023-07-19
Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2019-08-05). "Optimal packings of bounded degree trees" (PDF). Journal of the European Mathematical Society (dalam bahasa Inggris). 21 (12): 3573–3647. doi:10.4171/JEMS/909. ISSN 1435-9855. S2CID 119315954. Diarsipkan (PDF) dari versi aslinya tanggal 2020-03-09. Diakses tanggal 2020-03-09.
Hartnett, Kevin, "Rainbow Proof Shows Graphs Have Uniform Parts", Quanta Magazine (dalam bahasa Inggris), diarsipkan dari versi aslinya tanggal 2020-02-20, diakses tanggal 2020-02-20
Tichy, Robert F.; Wagner, Stephan (2005), "Extremal problems for topological indices in combinatorial chemistry" (PDF), Journal of Computational Biology, 12 (7): 1004–1013, CiteSeerX 10.1.1.379.8693, doi:10.1089/cmb.2005.12.1004, PMID 16201918, diarsipkan (PDF) dari versi aslinya tanggal 2017-09-21, diakses tanggal 2012-03-29.

worldcat.org

search.worldcat.org

Joos, Felix; Kim, Jaehoon; Kühn, Daniela; Osthus, Deryk (2019-08-05). "Optimal packings of bounded degree trees" (PDF). Journal of the European Mathematical Society (dalam bahasa Inggris). 21 (12): 3573–3647. doi:10.4171/JEMS/909. ISSN 1435-9855. S2CID 119315954. Diarsipkan (PDF) dari versi aslinya tanggal 2020-03-09. Diakses tanggal 2020-03-09.