Intersection graphs of maximal hypercubes

European Journal of Combinatorics - Tập 24 - Trang 195-209 - 2003
Boštjan Brešar1
1University of Maribor, FEECS, Smetanova 17, 2000 Maribor, Slovenia

Tài liệu tham khảo

Bandelt, 1996, Graphs of acyclic cubical complexes, European J. Combin., 17, 113, 10.1006/eujc.1996.0010 Bandelt, 1991, Clique graphs and Helly graphs, J. Combin. Theory Ser. B, 51, 34, 10.1016/0095-8956(91)90004-4 Bandelt, 1991, Superextensions and the depth of median graphs, J. Combin. Theory Ser. A, 57, 187, 10.1016/0097-3165(91)90044-H Berge, 1989 Brandstädt, 1998, Dually chordal graphs, SIAM J. Discrete Math., 11, 437, 10.1137/S0895480193253415 Brandstädt, 1999 Bres̆ar, 2001, Partial Hamming graphs and expansion procedures, Discrete Math., 237, 13, 10.1016/S0012-365X(00)00362-9 Chepoi, 1988, d-convexity and isometric subgraphs of Hamming graphs, Cybernetics, 1, 6, 10.1007/BF01069520 Djoković, 1973, Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B, 14, 263, 10.1016/0095-8956(73)90010-5 Golumbic, 1980 Imrich, 1998, A convexity lemma and expansion procedures for bipartite graphs, European J. Combin., 19, 677, 10.1006/eujc.1998.0229 Imrich, 2000 Klavz̆ar, 1999, Median graphs: characterizations, location theory and related structures, J. Combin. Math. Combin. Comput., 30, 103 McKee, 1999 Moscarini, 1993, Doubly chordal graphs, Steiner trees, and connected domination, Networks, 23, 59, 10.1002/net.3230230108 Mulder, 1978, The structure of median graphs, Discrete Math., 24, 197, 10.1016/0012-365X(78)90199-1 Mulder, 1980, n-cubes and median graphs, J. Graph Theory, 4, 107, 10.1002/jgt.3190040112 Mulder, 1990, The expansion procedure for graphs, 459 Roberts, 1971, A characterization of clique graphs, J. Combin. Theory Ser. B, 10, 102, 10.1016/0095-8956(71)90070-0 Szwarcfiter, 1994, Clique graphs of chordal and path graphs, SIAM J. Discrete Math., 7, 331, 10.1137/S0895480191223191 van de Vel, 1993 Winkler, 1984, Isometric embeddings in products of complete graphs, Discrete Appl. Math., 7, 221, 10.1016/0166-218X(84)90069-6