본문 바로가기
KERD
논문KCI 등재

On two graph partitioning questions

1

조회

0

다운로드

0

인용

0

참고문헌

주제분류수학

초록

Abstract

M. J"{u}nger, G. Reinelt, and W. R. Pulleyblank asked thefollowing questions ([2]). (1) Is it true that every simple planar2-edge connected bipartite graph has a 3-partition in whicheach component consists of the edge set of a simple path? (2) Doesevery simple planar 2-edge connected graph have a 3-partition inwhich every component consists of the edge set of simple paths andtriangles?The purpose of this paper is toprovide a positive answer to the second question for simpleouterplanar 2-vertex connected graphs and a positive answer tothe first question for simple planar 2-edge connected bipartitegraphs one set of whose bipartition has at most 4

참고문헌 (2)

  1. "\it On partitioning the edges of graphs into connected subgraphs}", pp.539~ (1985)
  2. "\it Introduction to graph theory}" (1996), Prentice-Hall

관련 논문AI추천

이 간행물의 다른 논문 (14건)