Browse > Article

Conditions for Disjoint Path Coverability in Proper Interval Graphs  

Park, Jung-Heum (가톨릭대학교 컴퓨터정보공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.34, no.10, 2007 , pp. 539-554 More about this Journal
Abstract
In this Paper, we investigate conditions for proper interval graphs to have k-disjoint path covers of three types each: one-to-one, one-to-many, and many-to-many. It was proved that for $k{\geq}2$, a proper interval graph is one-to-one k-disjoint path coverable if and only if the graph is k-connected, and is one-to-many k-disjoint path coverable if and only if the graph is k+1-connected. For $k{\geq}3$, a Proper interval graph is (paired) many-to-many k-disjoint path coverable if and only if the graph is 2k-1-connected.
Keywords
Disjoint path covers; proper interval graphs; connectivity; hamiltonian-connected graph;
Citations & Related Records
Times Cited By KSCI : 3  (Citation Analysis)
연도 인용수 순위
1 C.-H. Tsai, J.J.M. Tan, and L.-H. Hsu, 'The super-connected property of recursive circulant graphs,' Inform. Proc. Lett. 91(6), pp. 293-298, 2004   DOI   ScienceOn
2 C.-H. Chang, C.-K. Lin, H.-M. Huang, and L.-H. Hsu, 'The super laceability of the hypercubes,' Inform. Proc. Lett. 92(1), pp. 15-21, 2004   DOI   ScienceOn
3 J.-H. Park, 'One-to-many disjoint path covers in a graph with faulty elements,' in Proc. of the International Computing and Combinatorics Conference COCOON 2004, pp. 392-401, Aug. 2004
4 A.A. Bertossi, 'Finding hamiltonian circuits in proper interval graphs,' Inform. Proc. Lett. 17, pp. 97-101, 1983   DOI   ScienceOn
5 J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Many-to-many disjoint path covers in a graph with faulty elements,' in Proc. of the International Symposium on Algorithms and Computation ISAAC 2004, pp. 742-753, Dec. 2004
6 J.-H. Park, 'Unpaired many-to-many disjoint path covers in hypercube-like interconnection networks,' Journal of KISS 33(10), pp. 789-796, 2006   과학기술학회마을
7 M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, Inc. 1980
8 J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, 5th printing, American Elsevier Publishing Co., Inc., 1976
9 J.-H. Park, H.-C. Kim, and H.-S. Lim, 'Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements,' IEEE Trans. Parallel and Distributed Systems 17(3), pp. 227-240, Mar. 2006   DOI
10 J.-H. Park, 'Many-to-many disjoint path covers in double loop networks,' Journal of KISS 32(8), pp. 426-431, 2005
11 C. Chen, C.-C. Chang, G.J. Chang, 'Proper interval graphs and the guard problem,' Discrete Mathematics 170, pp. 223-230, 1997   DOI
12 J.-H. Park, 'One-to-one disjoint path covers in recursive circulants,' Journal of KISS 30(12), pp. 691-698, 2003
13 F.S. Roberts, 'Indifference graphs,' in F. Harary (ed.), Proof Techniques in Graph Theory, Academic Press, NY, pp. 139-146, 1969