Median graphs and triangle-free graphs

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 1, 1999, Pages 111-118

  Imrich, Wilfried ^a   Klavžar, Sandi ^b   Mulder, Henry Martyn ^c  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF MARIBOR   (Slovenia)

^c ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Algorithm; Complexity; Median graph; Triangle free graph

Indexed keywords

EID: 0011269199     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197323494     Document Type: Article

References (18)

1. N. ALON, R. YUSTER, AND U. ZWICK, Color-coding, J. Assoc. Comput. Mach., 42 (1995), pp. 844-856.
2. N. ALON, R. YUSTER, AND U. ZWICK, Finding and counting given length cycles, Algorithmica, 17 (1997), pp. 209-223.
3. F. AURENHAMMER, J. HAGAUER, AND W. IMRICH, Cartesian graph factorization at logarithmic cost per edge, Comput. Complexity, 2 (1992), pp. 331-349.
4. H.-J. BANDELT, Characterizing Median Graphs, manuscript, 1982.
5. H.-J. BANDELT, Retracts of hypercubes, J. Graph Theory, 8 (1984), pp. 501-510.
6. H.-J. BANDELT AND M. VAN DE VEL, Superextensions and the depth of median graphs, J. Combin. Theory Ser. A, 57 (1991), pp. 187-202.
7. N. CHIBA AND T. NISHIZEKI, Arboricity and subgraph listing algorithms, SIAM J. Comput., 14 (1985), pp. 210-223.
8. F.R.K. CHUNG, R.L. GRAHAM, AND M.E. SAKS, Dynamic search in graphs, in Discrete Algorithms and Complexity, H. Wilf, ed., Academic Press, New York, 1987, pp. 351-387.
9. J. HAGAUER, W. IMRICH, AND S. KLAVŽAR, Recognizing median graphs in subquadratic time, Theoret. Comput. Sci., to appear.
10. W. IMRICH AND S. KLAVŽAR, On the complexity of recognizing Hamming graphs and related classes of graphs, European J. Combin., 17 (1996), pp. 209-221.
11. W. IMRICH AND S. KLAVŽAR, A convexity lemma and expansion procedures for bipartite graphs, European J. Combin., 19 (1998), pp. 677-686.
12. A. ITAI AND M. RODEH, Finding a minimum circuit in a graph, SIAM J. Comput., 7 (1978), pp. 413-423.
13. P.K. JHA AND G. SLUTZKI, Convex-expansion algorithms for recognizing and isometric embedding of median graphs, Ars Combin., 34 (1992), pp. 75-92.
14. S. KLAVŽAR AND H.M. MULDER, Median graphs: Characterizations, location theory and related structures, J. Combin. Math. Combin. Comput., to appear.
15. F.R. MCMORRIS, H.M. MULDER, AND F.S. ROBERTS, The median procedure on median graphs, Discrete Appl. Math., 84 (1998), pp. 165-181.
16. H.M. MULDER, The structure of median graphs, Discrete Math., 24 (1978), pp. 197-204.
17. H.M. MULDER, The Interval Function of a Graph, Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980.
18. R. YUSTER AND U. ZWICK, Finding even cycles even faster, SIAM J. Discrete Math., 10 (1997), pp. 209-222.