Article citationsMore>>

Goddarda, W., Rainesb, M.E. and Slaterc, P.J. (2003) Distance and Connectivity Measures in Permutation Graphs. Discrete Mathematics, 271, 61-70.
https://doi.org/10.1016/S0012-365X(02)00870-1

has been cited by the following article:

• TITLE: Algorithm for the Vertex Connectivity Problem on Circular Trapezoid Graphs

  AUTHORS: Hirotoshi Honma, Kento Nishimura, Yuto Tamori, Yoko Nakajima

  KEYWORDS: Algorithm Design, Connectivity Problem, Intersection Graphs, Circular Trapezoid Graphs

  JOURNAL NAME: Journal of Applied Mathematics and Physics, Vol.7 No.11, November 5, 2019

  ABSTRACT: The vertex connectivity k(G) of a graph G is the minimum number of nodes whose deletion disconnects it. Graph connectivity is one of the most fundamental problems in graph theory. In this paper, we designed an O(n2) time algorithm to solve connectivity problem on circular trapezoid graphs.