SCOPUS 정보 검색 플랫폼

Volumn 307, Issue 3-5, 2007, Pages 345-351

On cube-free median graphs

Author keywords

Cartesian product; Cube free graph; Median graph; Recognition algorithm

Indexed keywords

ALGORITHMS; LINEAR ALGEBRA; POLYNOMIAL APPROXIMATION;

CARTESIAN PRODUCT; CUBE-FREE GRAPH; MEDIAN GRAPH; RECOGNITION ALGORITHM;

TREES (MATHEMATICS);

EID: 33845658321 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/j.disc.2004.09.018 Document Type: Article

Times cited : (11)

References (14)

1
- 0000445027
- Finding and counting given length cycles
- Alon N., Yuster R., and Zwick U. Finding and counting given length cycles. Algorithmica 17 (1997) 209-223
- (1997) Algorithmica , vol.17 , pp. 209-223
- Alon, N.¹ Yuster, R.² Zwick, U.³

2
- 0000984533
- Medians in median graphs
- Bandelt H.-J., and Barthélemy J.P. Medians in median graphs. Discrete Appl. Math. 8 (1984) 131-142
- (1984) Discrete Appl. Math. , vol.8 , pp. 131-142
- Bandelt, H.-J.¹ Barthélemy, J.P.²

3
- 0023315420
- Absolute retracts of bipartite graphs
- Bandelt H.-J., Dählmnann A., and Schütte H. Absolute retracts of bipartite graphs. Discrete Appl. Math. 16 (1987) 191-215
- (1987) Discrete Appl. Math. , vol.16 , pp. 191-215
- Bandelt, H.-J.¹ Dählmnann, A.² Schütte, H.³

4
- 0038743967
- B. Brešar, S. Klavžar, R. Škrekovski, The cube polynomial and its derivatives: the case of median graphs, Electron. J. Combin. 10 (2003) #R3, 11pp.

5
- 33749306854
- Distance preserving subgraphs of hypercubes
- Djoković D. Distance preserving subgraphs of hypercubes. J. Combin. Theory Ser. B 14 (1973) 263-267
- (1973) J. Combin. Theory Ser. B , vol.14 , pp. 263-267
- Djoković, D.¹

6
- 19544390029
- Partial k-tree algorithms
- El-Mallah E.S., and Colbourn C.J. Partial k-tree algorithms. Congr. Numer. 64 (1988) 105-119
- (1988) Congr. Numer. , vol.64 , pp. 105-119
- El-Mallah, E.S.¹ Colbourn, C.J.²

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

8
- 0011269199
- Median graphs and triangle-free graphs
- Imrich W., Klavžar S., and Mulder H.M. Median graphs and triangle-free graphs. SIAM J. Discrete Math. 12 (1999) 111-118
- (1999) SIAM J. Discrete Math. , vol.12 , pp. 111-118
- Imrich, W.¹ Klavžar, S.² Mulder, H.M.³

9
- 0037729864
- An Euler-type formula for median graphs
- Klavžar S., Mulder H.M., and Škrekovski R. An Euler-type formula for median graphs. Discrete Math. 187 (1998) 255-258
- (1998) Discrete Math. , vol.187 , pp. 255-258
- Klavžar, S.¹ Mulder, H.M.² Škrekovski, R.³

10
- 0038405863
- On median graphs and median grid graphs
- Klavžar S., and Škrekovski R. On median graphs and median grid graphs. Discrete Math. 219 (2000) 287-293
- (2000) Discrete Math. , vol.219 , pp. 287-293
- Klavžar, S.¹ Škrekovski, R.²

11
- 0001631178
- The median procedure on median graphs
- McMorris F.R., Mulder H.M., and Roberts F.R. The median procedure on median graphs. Discrete Appl. Math. 84 (1998) 165-181
- (1998) Discrete Appl. Math. , vol.84 , pp. 165-181
- McMorris, F.R.¹ Mulder, H.M.² Roberts, F.R.³

12
- 0000917739
- The structure of median graphs
- Mulder H.M. The structure of median graphs. Discrete Math. 24 (1978) 197-204
- (1978) Discrete Math. , vol.24 , pp. 197-204
- Mulder, H.M.¹

13
- 33845618062
- H.M. Mulder, The Interval Function of a Graph, Math. Centre Tracts 132, Math. Centre, Amsterdam, 1980.

14
- 0021372972
- Isometric embedding in products of complete graphs
- Winkler P. Isometric embedding in products of complete graphs. Discrete Appl. Math. 7 (1984) 221-225
- (1984) Discrete Appl. Math. , vol.7 , pp. 221-225
- Winkler, P.¹

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