• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(B)
• /
• pp.488-491
• /
• 2011

For given g ${\geq}$ 3, this paper provides an O(1) time and O(n) space complexity algorithm for generation of biconnected rooted colored outerplanar graphs with face size bound g, where the graphs generated contain at most n vertices. The vertices are colored in such a way that each color has a corresponding degree bound. There is also a face size bound for each inner face of the graph. No duplications or isomorphic copies of a same graph are generated.

• 대한수학회지
• /
• 제42권4호
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제10권2호
• /
• pp.4-8
• /
• 1972

We consider the class (equation omitted) of all k-degenerate graphs, for k a non-negative integer. The class (equation omitted) and (equation omitted) are exactly the classes of totally disconnected graphs and of forests, respectively; the classes (equation omitted) and (equation omitted) properly contain all outerplanar and planar graphs respectively. The advantage of this view point is that many of the known results for chromatic number and point arboricity have natural extensions, for all larger values of k. The purpose of this note is to show that a graph G is (P$^3$)-realizable if G is planar and 3-degenerate.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.421-426
• /
• 2007

The problem of vertex labeling with a condition at distance two in a graph, is a variation of Hale's channel assignment problem, which was first explored by Griggs and Yeh. For positive integer $p{\geq}q$, the ${\lambda}_{p,q}$-number of graph G, denoted ${\lambda}(G;p,q)$, is the smallest span among all integer labellings of V(G) such that vertices at distance two receive labels which differ by at least q and adjacent vertices receive labels which differ by at least p. Van den Heuvel and McGuinness have proved that ${\lambda}(G;p,q){\leq}(4q-2){\Delta}+10p+38q-24$ for any planar graph G with maximum degree ${\Delta}$. In this paper, we studied the upper bound of ${\lambda}_{p,q}$-number of some planar graphs. It is proved that ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+2(2p-1)$ if G is an outerplanar graph and ${\lambda}(G;p,q){\leq}(2q-1){\Delta}+6p-4q-1$ if G is a Halin graph.

• 대한수학회논문집
• /
• 제35권1호
• /
• pp.1-12
• /
• 2020

A pathos block line cut-vertex graph of a tree T, written P BL_c(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BL_c(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block B_i of T and the other corresponds to a cut-vertex c_j of T such that c_j is in B_i; two distinct pathos vertices P_m and P_n of P BL_c(T) are adjacent whenever the corresponding paths of the pathos P_m(v_i, v_j) and P_n(v_k, v_l) have a common vertex. We study the properties of P BL_c(T) and present the characterization of graphs whose P BL_c(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BL_c(T) can never be one.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권11호
• /
• pp.1353-1362
• /
• 1999

그래프 드로잉이란 추상적인 그래프를 시각적으로 구성하여 2차원 평면상에 그려주는 작업으로 대칭성은 그래프 드로잉시 고려해야 하는 미적 기준들 중에서 그래프의 구조 및 특성을 표현해주는 가장 중요한 기준이다. 그러나 일반 그래프에서 대칭성을 찾아 그려 주는 문제는 NP-hard로 증명이 되어 있기 때문에 현재까지는 트리, 외부평면 그래프, 직병렬 유향 그래프나 평면 그래프 등으로 대상을 한정시켜 연구가 진행되어 왔다. 본 논문에서는 병렬 컴퓨터나 컴퓨터 네트워크 구조를 가시화 시키기 위하여 많이 사용되는 그래프인 상호연결망(interconnection network)의 대칭성을 분석하고 분석된 대칭성을 최대로 보여주는 대칭 드로잉 알고리즘을 제안하였다. 그리고 이를 기반으로 하여 상호연결망의 기존 드로잉 방법들과 본 논문에서 제안한 대칭 드로잉 등 다양한 드로잉을 지원하는 WWW 기반의 상호연결망 드로잉 시스템을 구현하였다.Abstract Graph drawing is constructing a visually-informative drawing of an abstract graph. Symmetry is one of the most important aesthetic criteria that clearly reveals the structures and the properties of graphs. However, the problem of finding geometric symmetry in general graphs is NP-hard. So the previous work has focused on the subclasses of general graphs such as trees, outerplanar graphs, series-parallel digraphs and planar graphs.In this paper, we analyze the geometric symmetry on the various interconnection networks which have many applications in the design of computer networks, parallel computer architectures and other fields of computer science. Based on these analysis, we develope algorithms for constructing the drawings of interconnection networks which show the maximal symmetries.We also design and implement Interconnection Network Drawing System (INDS) on WWW which supports the various drawings including the conventional drawings and our suggested symmetric drawings.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.96-100
• /
• 2005

This paper studies the problem of inferring a chemical compound from a feature vector consisting of the numbers of occurrences of vertex-labeled paths, which has potential future applications for designing new chemical compounds based on the kernel methods. This paper shows that the problem for outerplanar graphs of bounded degree can be solved in polynomial time if an alphabet is fixed and the maximum length of paths and the number of edges of each face are bounded by a constant. It is also shown that the problem is strongly NP-hard even for trees of unbounded degree.