King's graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "King's graph" in English language version.

refsWebsite

Global rank English rank

451^st place

277^th place

2^nd place

2^nd place

1books.google.com

3^rd place

3^rd place

low place

low place

742^nd place

538^th place

6^th place

6^th place

207^th place

136^th place

26^th place

20^th place

3,558^th place

2,403^rd place

ams.org

mathscinet.ams.org

Chang, Gerard J. (1998), "Algorithmic aspects of domination in graphs", in Du, Ding-Zhu; Pardalos, Panos M. (eds.), Handbook of combinatorial optimization, Vol. 3, Boston, MA: Kluwer Acad. Publ., pp. 339–405, MR 1665419. Chang defines the king's graph on p. 341.
Berend, Daniel; Korach, Ephraim; Zucker, Shira (2005), "Two-anticoloring of planar and related graphs" (PDF), 2005 International Conference on Analysis of Algorithms, Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341, MR 2193130.
Klešč, Marián; Petrillová, Jana; Valo, Matúš (2013), "Minimal number of crossings in strong product of paths", Carpathian Journal of Mathematics, 29 (1): 27–32, doi:10.37193/CJM.2013.01.13, JSTOR 43999517, MR 3099062
Ma, Dengju (2017), "The crossing number of the strong product of two paths" (PDF), The Australasian Journal of Combinatorics, 68: 35–47, MR 3631655

archive.org

Chepoi, Victor; Dragan, Feodor; Vaxès, Yann (2002), "Center and diameter problems in plane triangulations and quadrangulations", Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pp. 346–355, CiteSeerX 10.1.1.1.7694, ISBN 0-89871-513-X.

books.google.com

Chang, Gerard J. (1998), "Algorithmic aspects of domination in graphs", in Du, Ding-Zhu; Pardalos, Panos M. (eds.), Handbook of combinatorial optimization, Vol. 3, Boston, MA: Kluwer Acad. Publ., pp. 339–405, MR 1665419. Chang defines the king's graph on p. 341.

doi.org

Smith, Alvy Ray (1971), "Two-dimensional formal languages and pattern recognition by cellular automata", 12th Annual Symposium on Switching and Automata Theory, pp. 144–152, doi:10.1109/SWAT.1971.29.
Klešč, Marián; Petrillová, Jana; Valo, Matúš (2013), "Minimal number of crossings in strong product of paths", Carpathian Journal of Mathematics, 29 (1): 27–32, doi:10.37193/CJM.2013.01.13, JSTOR 43999517, MR 3099062

emis.de

Berend, Daniel; Korach, Ephraim; Zucker, Shira (2005), "Two-anticoloring of planar and related graphs" (PDF), 2005 International Conference on Analysis of Algorithms, Discrete Mathematics & Theoretical Computer Science Proceedings, Nancy: Association for Discrete Mathematics & Theoretical Computer Science, pp. 335–341, MR 2193130.

jstor.org

Klešč, Marián; Petrillová, Jana; Valo, Matúš (2013), "Minimal number of crossings in strong product of paths", Carpathian Journal of Mathematics, 29 (1): 27–32, doi:10.37193/CJM.2013.01.13, JSTOR 43999517, MR 3099062

oeis.org

Sloane, N. J. A. (ed.). "Sequence A002943". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

psu.edu

citeseerx.ist.psu.edu

Chepoi, Victor; Dragan, Feodor; Vaxès, Yann (2002), "Center and diameter problems in plane triangulations and quadrangulations", Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pp. 346–355, CiteSeerX 10.1.1.1.7694, ISBN 0-89871-513-X.

uq.edu.au

ajc.maths.uq.edu.au

Ma, Dengju (2017), "The crossing number of the strong product of two paths" (PDF), The Australasian Journal of Combinatorics, 68: 35–47, MR 3631655