Hipohamiltonov graf (Slovenian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hipohamiltonov graf" in Slovenian language version.

refsWebsite

Global rank Slovenian rank

23doi.org

2^nd place

5^th place

19ams.org

451^st place

701^st place

3jstor.org

26^th place

53^rd place

3arxiv.org

69^th place

79^th place

2cobiss.net

3,715^th place

6^th place

1umi-lj.si

low place

ams.org

mathscinet.ams.org

Lindgren (1967). Lindgren, W. F. (1967), »An infinite class of hypohamiltonian graphs«, American Mathematical Monthly, Mathematical Association of America, 74 (9): 1087–1089, doi:10.2307/2313617, JSTOR 2313617, MR 0224501
Thomassen (1981). Thomassen, Carsten (1981), »Planar cubic hypo-Hamiltonian and hypotraceable graphs«, Journal of Combinatorial Theory, Series B, 30: 36–44, doi:10.1016/0095-8956(81)90089-7, MR 0609592
Thomassen (1974b). Thomassen, Carsten (1974b), »On hypohamiltonian graphs«, Discrete Mathematics, 10 (2): 383–390, doi:10.1016/0012-365X(74)90128-9, MR 0357226
Chvátal (1973). Chvátal, Václav (1973), »Flip-flops in hypo-Hamiltonian graphs«, Canadian Mathematical Bulletin, 16: 33–41, doi:10.4153/CMB-1973-008-9, MR 0371722
Grünbaum (1974). Grünbaum, Branko (1974), »Vertices missed by longest paths or circuits«, Journal of Combinatorial Theory, Series A, 17: 31–38, doi:10.1016/0097-3165(74)90025-9, MR 0349474
Thomassen (1976). Thomassen, Carsten (1976), »Planar and infinite hypohamiltonian and hypotraceable graphs«, Discrete Mathematics, 14 (4): 377–389, doi:10.1016/0012-365X(76)90071-6, MR 0422086
Hatzel (1979). Hatzel, Wolfgang (1979), »Ein planarer hypohamiltonscher Graph mit 57 Knoten«, Mathematische Annalen, 243 (3): 213–216, doi:10.1007/BF01424541, MR 0548801
Thomassen (1978). Thomassen, Carsten (1978), »Hypohamiltonian graphs and digraphs«, Theory and applications of graphs (Proc. Internat. Conf., Western Mich. Univ., Kalamazoo, Mich., 1976), Lecture Notes in Mathematics, zv. 642, Berlin: Springer-Verlag, str. 557–571, MR 0499523
Steffen (1998). Steffen, Eckhard (1998), »Classification and characterizations of snarks«, Discrete Mathematics, 188 (1–3): 183–203, doi:10.1016/S0012-365X(97)00255-0, MR 1630478
Steffen (2001). Steffen, Eckhard (2001), »On bicritical snarks«, Mathematica Slovaca, 51 (2): 141–150, MR 1841443
Collier; Schmeichel (1977). Collier, James Bryan; Schmeichel, Edward Fred (1977), »New flip-flop constructions for hypohamiltonian graphs«, Discrete Mathematics, 18 (3): 265–271, doi:10.1016/0012-365X(77)90130-3, MR 0543828
Alspach (1983). Alspach, Brian Roger (1983), »The classification of Hamiltonian generalized Petersen graphs«, Journal of Combinatorial Theory, Series B, 34 (3): 293–312, doi:10.1016/0095-8956(83)90042-4, MR 0714452
Doyen; van Diest (1975). Doyen, Jean; van Diest, Viviane (1975), »New families of hypohamiltonian graphs«, Discrete Mathematics, 13 (3): 225–236, doi:10.1016/0012-365X(75)90020-5, MR 0416979
Gutt (1977). Gutt, Simone (1977), »Infinite families of hypohamiltonian graphs«, Académie Royale de Belgique, Bulletin de la Classe des Sciences, Koninklijke Belgische Academie, Mededelingen van de Klasse der Wetenschappen, 5e Série, 63 (5): 432–440, MR 0498243
Thomassen (1974a). Thomassen, Carsten (1974a), »Hypohamiltonian and hypotraceable graphs«, Discrete Mathematics, 9: 91–96, doi:10.1016/0012-365X(74)90074-0, MR 0347682
Herz (1968). Herz, J. C. (1968), »Sur la cyclabilité des graphes«, Computers in Mathematical Research, North-Holland, str. 97–107, MR 0245461
Kapoor; Kronk; Lick (1968). Kapoor, Šašičand Fatehčand; Kronk, Hudson Van Etten; Lick, Don Raymond (1968), »On detours in graphs«, Canadian Mathematical Bulletin, 11: 195–201, doi:10.4153/CMB-1968-022-8, MR 0229543
Fouquet; Jolivet (1978). Fouquet, Jean-Luc; Jolivet, J. L. (1978), »Hypohamiltonian oriented graphs«, Cahiers Centre Études Rech. Opér., 20 (2): 171–181, MR 0498218
Schauerte; Zamfirescu (2006). Schauerte, Boris; Zamfirescu, Carol T. (2006), »Regular graphs in which every pair of points is missed by some longest cycle«, An. Univ. Craiova Ser. Mat. Inform., 33: 154–173, MR 2359901

arxiv.org

Goedgebeur; Zamfirescu (2016). Goedgebeur, Jan; Zamfirescu, Carol T. (2016), Improved bounds for hypohamiltonian graphs, arXiv:1602.07171
Jooyandeh idr. (2013). Jooyandeh, Mohammadreza; McKay, Brendan Damien; Östergård, Patric R. J.; Pettersson, Ville H.; Zamfirescu, Carol T. (2013), Planar Hypohamiltonian Graphs on 40 Vertices, arXiv:1302.2698
Wiener; Araja (2009). Wiener, Gábor; Araja, Makoto (2009), The ultimate question, arXiv:0904.3012

cobiss.net

plus.cobiss.net

Krnc; Škrekovski (2015), str. 27. Krnc, Matjaž; Škrekovski, Riste (2015), Izbrana poglavja iz diskretne matematike (PDF), Ljubljana: samozal. R. Škrekovski, COBISS 279674880, ISBN 978-961-92887-5-7^{[mrtva povezava]}
Busacker; Saaty (1965). Busacker, Robert George; Saaty, Thomas Lorie (1965), Finite Graphs and Networks, McGraw-Hill, COBISS 11638617

doi.org

Lindgren (1967). Lindgren, W. F. (1967), »An infinite class of hypohamiltonian graphs«, American Mathematical Monthly, Mathematical Association of America, 74 (9): 1087–1089, doi:10.2307/2313617, JSTOR 2313617, MR 0224501
Grötschel (1980). Grötschel, Martin (1980), »On the monotone symmetric traveling salesman problem: hypohamiltonian/hypotraceable graphs and facets«, Mathematics of Operations Research, 5 (2): 285–292, doi:10.1287/moor.5.2.285, JSTOR 3689157
Grötschel; Wakabayashi (1981). Grötschel, Martin; Wakabayashi, Yoshiko (1981), »On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets«, Discrete Mathematics, 24: 43–59, doi:10.1016/0012-365X(81)90021-2
Goemans (1995). Goemans, Michel Xavier (1995), »Worst-case comparison of valid inequalities for the TSP«, Mathematical Programming, 69 (1–3): 335–349, doi:10.1007/BF01585563
Park; Lim; Kim (2007). Park, Jung-Heum; Lim, Hyeong-Seok; Kim, Hee-Chul (2007), »Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements«, Theoretical Computer Science, 377 (1–3): 170–180, doi:10.1016/j.tcs.2007.02.029
Bondy (1972). Bondy, John Adrian (1972), »Variations of the Hamiltonian theme«, Canadian Mathematical Bulletin, 15: 57–62, doi:10.4153/CMB-1972-012-3
Thomassen (1981). Thomassen, Carsten (1981), »Planar cubic hypo-Hamiltonian and hypotraceable graphs«, Journal of Combinatorial Theory, Series B, 30: 36–44, doi:10.1016/0095-8956(81)90089-7, MR 0609592
Thomassen (1974b). Thomassen, Carsten (1974b), »On hypohamiltonian graphs«, Discrete Mathematics, 10 (2): 383–390, doi:10.1016/0012-365X(74)90128-9, MR 0357226
Chvátal (1973). Chvátal, Václav (1973), »Flip-flops in hypo-Hamiltonian graphs«, Canadian Mathematical Bulletin, 16: 33–41, doi:10.4153/CMB-1973-008-9, MR 0371722
Grünbaum (1974). Grünbaum, Branko (1974), »Vertices missed by longest paths or circuits«, Journal of Combinatorial Theory, Series A, 17: 31–38, doi:10.1016/0097-3165(74)90025-9, MR 0349474
Thomassen (1976). Thomassen, Carsten (1976), »Planar and infinite hypohamiltonian and hypotraceable graphs«, Discrete Mathematics, 14 (4): 377–389, doi:10.1016/0012-365X(76)90071-6, MR 0422086
Hatzel (1979). Hatzel, Wolfgang (1979), »Ein planarer hypohamiltonscher Graph mit 57 Knoten«, Mathematische Annalen, 243 (3): 213–216, doi:10.1007/BF01424541, MR 0548801
Zamfirescu; Zamfirescu (2007). Zamfirescu, Carol T.; Zamfirescu, Tudor I. (2007), »A planar hypohamiltonian graph with 48 vertices«, Journal of Graph Theory, 55 (4): 338–342, doi:10.1002/jgt.20241
Steffen (1998). Steffen, Eckhard (1998), »Classification and characterizations of snarks«, Discrete Mathematics, 188 (1–3): 183–203, doi:10.1016/S0012-365X(97)00255-0, MR 1630478
Häggkvist (2007). Häggkvist, Roland (2007). »Problem 443. Special case of the Fulkerson Conjecture«. V Mohar, Bojan; Nowakowski, R. J.; West, D. B. (ur.). Research problems from the 5th Slovenian Conference (Bled, 2003). Discrete Mathematics. Zv. 307, št. 3–5. str. 650–658. doi:10.1016/j.disc.2006.07.013.
Collier; Schmeichel (1977). Collier, James Bryan; Schmeichel, Edward Fred (1977), »New flip-flop constructions for hypohamiltonian graphs«, Discrete Mathematics, 18 (3): 265–271, doi:10.1016/0012-365X(77)90130-3, MR 0543828
Alspach (1983). Alspach, Brian Roger (1983), »The classification of Hamiltonian generalized Petersen graphs«, Journal of Combinatorial Theory, Series B, 34 (3): 293–312, doi:10.1016/0095-8956(83)90042-4, MR 0714452
Doyen; van Diest (1975). Doyen, Jean; van Diest, Viviane (1975), »New families of hypohamiltonian graphs«, Discrete Mathematics, 13 (3): 225–236, doi:10.1016/0012-365X(75)90020-5, MR 0416979
Thomassen (1974a). Thomassen, Carsten (1974a), »Hypohamiltonian and hypotraceable graphs«, Discrete Mathematics, 9: 91–96, doi:10.1016/0012-365X(74)90074-0, MR 0347682
Skupień (2007). Skupień, Zdzislaw (2007), »Exponentially many hypohamiltonian snarks«, 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electronic Notes in Discrete Mathematics, zv. 28, str. 417–424, doi:10.1016/j.endm.2007.01.059
Kapoor; Kronk; Lick (1968). Kapoor, Šašičand Fatehčand; Kronk, Hudson Van Etten; Lick, Don Raymond (1968), »On detours in graphs«, Canadian Mathematical Bulletin, 11: 195–201, doi:10.4153/CMB-1968-022-8, MR 0229543
Kronk (1969). Kronk, Hudson Van Etten (1969), Klee, Victor (ur.), »Does there exist a hypotraceable graph?«, Research Problems, American Mathematical Monthly, Mathematical Association of America, 76 (7): 809–810, doi:10.2307/2317879, JSTOR 2317879
Menke; Zamfirescu; Zamfirescu (1998). Menke, B.; Zamfirescu, Tudor I.; Zamfirescu, Carol T. (1998), »Intersections of longest cycles in grid graphs«, Journal of Graph Theory, 25 (1): 37–52, doi:10.1002/(SICI)1097-0118(199705)25:1<37::AID-JGT2>3.0.CO;2-J

jstor.org

Lindgren (1967). Lindgren, W. F. (1967), »An infinite class of hypohamiltonian graphs«, American Mathematical Monthly, Mathematical Association of America, 74 (9): 1087–1089, doi:10.2307/2313617, JSTOR 2313617, MR 0224501
Grötschel (1980). Grötschel, Martin (1980), »On the monotone symmetric traveling salesman problem: hypohamiltonian/hypotraceable graphs and facets«, Mathematics of Operations Research, 5 (2): 285–292, doi:10.1287/moor.5.2.285, JSTOR 3689157
Kronk (1969). Kronk, Hudson Van Etten (1969), Klee, Victor (ur.), »Does there exist a hypotraceable graph?«, Research Problems, American Mathematical Monthly, Mathematical Association of America, 76 (7): 809–810, doi:10.2307/2317879, JSTOR 2317879

umi-lj.si

fmf.umi-lj.si

Krnc; Škrekovski (2015), str. 27. Krnc, Matjaž; Škrekovski, Riste (2015), Izbrana poglavja iz diskretne matematike (PDF), Ljubljana: samozal. R. Škrekovski, COBISS 279674880, ISBN 978-961-92887-5-7^{[mrtva povezava]}