Bipartite Steinhaus Graphs with Connectivity Two

논문KCI 등재

1

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

In this paper, we investigate the generating strings and the number of 2-(edge)connected bipartite Steinhaus graphs.

In this paper, we investigate the generating strings and the number of 2-(edge)connected bipartite Steinhaus graphs.

B. Bollobas, "Graph Theory" (1979), Springer-Verlag
W. M. Dymacek, "Bipartite Steinhaus graphs", Discrete Mathematics, 59, pp.9~22 (1986)
W. M. Dymacek, "Connectivity in Steinhaus graphs", in preperation, ~
W. M. Dymacek, "Generating strings for bipartite Steinhaus graphs", Discrete Mathematics, 141(1), pp.95~107 (1995)
W. M. Dymacek, "A survey of Steinhaus graphs, Proceedings of the Eighth Quadrennial Intrrnational Conference on Graph Theory, Combinatorics", Algorithm and Applications, 1, pp.313~323 (1998)
G. J. Chang, "Characterizations of bipartite Steinhaus graphs", Discrete Mathematics, 199, pp.11~25 (1999)
H. Harborth, "Solution of Steinhaus's problem with plus and minus signs", J. Combina-torial Theory Ser. A, 12, pp.253~259 (1972)
D. J. Kim, "2-connected and 2-edge-connected Steinhaus graphs", Discrete Math, 256(1), pp.257~265 (2002)
Dongju Kim, "Steinhaus Graphs with Minimum Degree Two", Kyungpook Mathematical Journal, 43(4), pp.567~577 (2003), 경북대학교 자연과학대학 수학과
H. Steinhaus, "One Hundred Problems in Elementary Mathematics" (1979), Dover