SCOPUS 정보 검색 플랫폼

Volumn 14, Issue 1 R, 2007, Pages 1-21

Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846650908 PISSN: None EISSN: 10778926 Source Type: Journal
DOI: 10.37236/936 Document Type: Article

Times cited : (10)

References (15)

1
- 26744444381
- Flip-flops in hypohamiltonian graphs
- V. Chvátal, Flip-flops in hypohamiltonian graphs, Canad. Math. Bull. 16 (1973), 33-41.
- (1973) Canad. Math. Bull , vol.16 , pp. 33-41
- Chvátal, V.¹

2
- 0040139250
- Smallest maximally nonhamiltonian graphs
- L. Clark and R. Entringer, Smallest maximally nonhamiltonian graphs, Period. Math. Hung. 14 (1983), 57-68.
- (1983) Period. Math. Hung , vol.14 , pp. 57-68
- Clark, L.¹ Entringer, R.²

3
- 33745848935
- New flip-flop constructions for hypohamiltonian graphs
- J. B. Collier and E. F. Schmeichel, New flip-flop constructions for hypohamiltonian graphs, Discrete Math. 18 (1977), 265-271.
- (1977) Discrete Math , vol.18 , pp. 265-271
- Collier, J.B.¹ Schmeichel, E.F.²

4
- 33846708713
- S. Fiorini, Hypohamiltonian snarks, in: Graphs and Other Combinatorial Topics, Proc. 3rd Czechoslovak Symp. on Graph Theory, Prague, Aug. 24-27, 1982 (M. Fiedler, Ed.), Teubner-Texte zur Math., Bd. 59, Teubner, Leipzig, 1983, 70-75.
- S. Fiorini, Hypohamiltonian snarks, in: Graphs and Other Combinatorial Topics, Proc. 3rd Czechoslovak Symp. on Graph Theory, Prague, Aug. 24-27, 1982 (M. Fiedler, Ed.), Teubner-Texte zur Math., Bd. 59, Teubner, Leipzig, 1983, 70-75.

6
- 0001309322
- The planar Hamiltonian circuit problem is NP-complete
- M. R. Garey, D. S. Johnson, and R. E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput. 5 (1976), 704-714.
- (1976) SIAM J. Comput , vol.5 , pp. 704-714
- Garey, M.R.¹ Johnson, D.S.² Tarjan, R.E.³

7
- 33846708410
- Infinite families of hypohamiltonian graphs
- S. Gutt, Infinite families of hypohamiltonian graphs, Acad. Roy. Belg. Bull. Cl. Sci. V. Sér. 63 (1977), 432-440.
- (1977) Acad. Roy. Belg. Bull. Cl. Sci. V. Sér , vol.63 , pp. 432-440
- Gutt, S.¹

8
- 0001634441
- Infinite families of non-trivial trivalent graphs which are not Tait colorable
- R. Isaacs, Infinite families of non-trivial trivalent graphs which are not Tait colorable, Am. Math. Monthly, 82 (1975), 221-239.
- (1975) Am. Math. Monthly , vol.82 , pp. 221-239
- Isaacs, R.¹

9
- 77957156548
- Problem session
- F. Jaeger and T. Swart, Problem session, Ann. Discrete Math. 9 (1980), 305.
- (1980) Ann. Discrete Math , vol.9 , pp. 305
- Jaeger, F.¹ Swart, T.²

10
- 0030141041
- Snarks without small cycles
- M. Kochol, Snarks without small cycles, J. Combin. Theory Ser. B 67 (1996), 34-47.
- (1996) J. Combin. Theory Ser. B , vol.67 , pp. 34-47
- Kochol, M.¹

11
- 33645855838
- Atoms of cyclic connectivity in cubic graphs
- R. Nedela and M. Škoviera, Atoms of cyclic connectivity in cubic graphs, Math. Slovaca 45 (1995), 481-499.
- (1995) Math. Slovaca , vol.45 , pp. 481-499
- Nedela, R.¹ Škoviera, M.²

12
- 0030548383
- Decompositions and reductions of snarks
- R. Nedela and M. Škoviera, Decompositions and reductions of snarks, J. Graph Theory, 22 (1996), 253-279.
- (1996) J. Graph Theory , vol.22 , pp. 253-279
- Nedela, R.¹ Škoviera, M.²

13
- 0012958206
- Classifications and characterizations of snarks
- E. Steffen, Classifications and characterizations of snarks, Discrete Math. 188 (1998), 183-203.
- (1998) Discrete Math , vol.188 , pp. 183-203
- Steffen, E.¹

14
- 0012998034
- On bicritical snarks
- E. Steffen, On bicritical snarks, Math. Slovaca 51 (2001), 141-150.
- (2001) Math. Slovaca , vol.51 , pp. 141-150
- Steffen, E.¹

15
- 0004381688
- Hypohamiltonian and hypotraceable graphs
- C. Thomassen, Hypohamiltonian and hypotraceable graphs, Discrete Math 9 (1974), 91-96.
- (1974) Discrete Math , vol.9 , pp. 91-96
- Thomassen, C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.