SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Australasian Journal of Combinatorics

Volumn 26, Issue , 2002, Pages 233-244

Minimum cycle bases of product graphs

(2) Imrich, Wilfried a Stadler, Peter F b,c

a UNIVERSITY OF LEOBEN (Austria)

b UNIVERSITY OF VIENNA (Austria)

c SANTA FE INSTITUTE (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33947502530 PISSN: 10344942 EISSN: 22023518 Source Type: Journal
DOI: None Document Type: Article

Times cited : (16)

References (20)

1
- 0028463963
- Efficient exact solution of the ring perception problem
- R. Balducci and R.S. Pearlman. Efficient exact solution of the ring perception problem. J. Chem. Inf. Comput. Sci., 34:822-831, 1994.
- (1994) J. Chem. Inf. Comput. Sci. , vol.34 , pp. 822-831
- Balducci, R.¹ Pearlman, R.S.²

2
- 38249036984
- On the null-homotopy of graphs
- C. Champetier. On the null-homotopy of graphs. Discr. Math., 64:97-98, 1987.
- (1987) Discr. Math. , vol.64 , pp. 97-98
- Champetier, C.¹

3
- 0015054236
- On vector spaces associated with a graph
- W.-K. Chen. On vector spaces associated with a graph. SIAM J. Appl. Math., 20:525-529, 1971.
- (1971) SIAM J. Appl. Math. , vol.20 , pp. 525-529
- Chen, W.-K.¹

4
- 0142037690
- On finding a cycle basis with a shortest maximal cycle
- D.M. Chickering, D. Geiger and D. Heckerman. On finding a cycle basis with a shortest maximal cycle. Inform. Processing Let., 54:55-58, 1994.
- (1994) Inform. Processing Let. , vol.54 , pp. 55-58
- Chickering, D.M.¹ Geiger, D.² Heckerman, D.³

5
- 0015660274
- On optimally sparse cycle and coboundary basis for a linear graph
- L.O. Chua and L. Chen. On optimally sparse cycle and coboundary basis for a linear graph. IEEE Trans. Circuit Theory, 20:54-76, 1973.
- (1973) IEEE Trans. Circuit Theory , vol.20 , pp. 54-76
- Chua, L.O.¹ Chen, L.²

6
- 0024716526
- Review of ring perception algorithms for chemical graphs
- G.M. Downs, V.J. Gillet, J.D. Holliday and M.F. Lynch. Review of ring perception algorithms for chemical graphs. J. Chem. Inf. Comput. Sci., 29:172-187, 1989.
- (1989) J. Chem. Inf. Comput. Sci. , vol.29 , pp. 172-187
- Downs, G.M.¹ Gillet, V.J.² Holliday, J.D.³ Lynch, M.F.⁴

7
- 38249039181
- Connected cutsets of a graph and a triangle basis of the cycle space
- P. Duchet, M. Las Vergnas and H. Meyniel. Connected cutsets of a graph and a triangle basis of the cycle space. Discr. Math., 62:145-154, 1986.
- (1986) Discr. Math. , vol.62 , pp. 145-154
- Duchet, P.¹ Las Vergnas, M.² Meyniel, H.³

8
- 13744255343
- Elementa doctrinae solidorum
- (Latin)
- L. Euler. Elementa doctrinae solidorum. Novi Comm. Acad. Sci. Imp. Petropol., 4:109-140, 1752. (Latin).
- (1752) Novi Comm. Acad. Sci. Imp. Petropol , vol.4 , pp. 109-140
- Euler, L.¹

9
- 0001100941
- Correlation length, isotropy, and meta-stable states
- R. García-Pelayo and P.F. Stadler. Correlation length, isotropy, and meta-stable states. Physica D, 107:240-254, 1997.
- (1997) Physica D , vol.107 , pp. 240-254
- García-Pelayo, R.¹ Stadler, P.F.²

10
- 1842780616
- Interchangeability of relevant cycles in graphs
- [16pages]
- P.M. Gleiss, J. Leydold and P.F. Stadler. Interchangeability of relevant cycles in graphs. Elec. J. Comb., 7:R16 [16pages], 2000.
- (2000) Elec. J. Comb. , vol.7
- Gleiss, P.M.¹ Leydold, J.² Stadler, P.F.³

11
- 0033424572
- Cyclicity of graphs
- R. Hammack. Cyclicity of graphs. J. Graph Theory, 32:160-170, 1999.
- (1999) J. Graph Theory , vol.32 , pp. 160-170
- Hammack, R.¹

12
- 1842629269
- The all-pair min-cut problem and the minimum cycle basis problem on planar graphs
- D. Hartvigsen and R. Mardon. The all-pair min-cut problem and the minimum cycle basis problem on planar graphs. SIAM J. Discr. Math., 7:403-418, 1994.
- (1994) SIAM J. Discr. Math. , vol.7 , pp. 403-418
- Hartvigsen, D.¹ Mardon, R.²

13
- 0023328260
- A polynomial-time algorithm to find the shortest cycle basis of a graph
- J.D. Horton. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput., 16:359-366, 1987.
- (1987) SIAM J. Comput. , vol.16 , pp. 359-366
- Horton, J.D.¹

14
- 0003628648
- Wiley, New York
- W. Imrich and S. Klavžar. Product Graphs: Structure and Recognition. Wiley, New York, 2000.
- (2000) Product Graphs: Structure and Recognition
- Imrich, W.¹ Klavžar, S.²

15
- 0003767393
- Research Studies Press, Exeter, UK
- A. Kaveh. Structural Mechanics: Graph and Matrix Methods. Research Studies Press, Exeter, UK, 1992.
- (1992) Structural Mechanics: Graph and Matrix Methods
- Kaveh, A.¹

16
- 10044255454
- Minimal cycle basis of outerplanar graphs
- [R16: 14 p.]
- J. Leydold and P.F. Stadler. Minimal cycle basis of outerplanar graphs. Elec. J. Comb., 5:209-222 [R16: 14 p.], 1998. http://www.combinatorics.org/.
- (1998) Elec. J. Comb. , vol.5 , pp. 209-222
- Leydold, J.¹ Stadler, P.F.²

17
- 84986524461
- On connectivities of tree graphs
- G. Liu. On connectivities of tree graphs. J. Graph Theory, 12:435-459, 1988.
- (1988) J. Graph Theory , vol.12 , pp. 435-459
- Liu, G.¹

18
- 0012035459
- Mathematical basis of ring-finding algorithms in CIDS
- M. Plotkin. Mathematical basis of ring-finding algorithms in CIDS. J. Chem. Doc., 11:60-63, 1971.
- (1971) J. Chem. Doc. , vol.11 , pp. 60-63
- Plotkin, M.¹

19
- 13744260090
- Union of all the minimum cycle bases of a graph
- Paper No. #R9 (15 pages)
- P. Vismara. Union of all the minimum cycle bases of a graph. Electr. J. Comb., 4:73-87, 1997. Paper No. #R9 (15 pages).
- (1997) Electr. J. Comb. , vol.4 , pp. 73-87
- Vismara, P.¹

20
- 0039140232
- Kruskal's theorem for matroids
- D.J.A. Welsh. Kruskal's theorem for matroids. Proc. Cambridge Phil. Soc., 64:3-4, 1968.
- (1968) Proc. Cambridge Phil. Soc. , vol.64 , pp. 3-4
- Welsh, D.J.A.¹

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