In this paper we will look at the relationship between the intersection number c2 and its diameter for a distance-regular graph. And also, we give some tools to show that a distance-regular graph with large c2 is bipartite, and a tool to show that if kD is too small then the distance-regular graph has to be antipodal.

A path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369–384, 2009

An undirected graph G is called an EPT graph if it is the edge intersection graph of a family of paths in a tree. We call G a local EPT graph if it is the EPT graph of a collection of paths P which all share a common vertex. In this paper, we characterize the local EPT graphs which can be represented in a host tree with maximum degree h.

In this paper, we show that any B2-VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into O(logn) outerstring graphs or O(log n) permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on B2-VPG graphs.

In this work, we study the cellular decomposition of S induced by a filling pair curves v and w, \(Dec_{v,w}(S) = {\setminus } (v \cup w)\), its connection to distance function d(v, w) in curve graph closed orientable surface genus g. Building on work Leasure, efficient geodesics were introduced first author joint with Margalit Menasco 2016, giving an algorithm that begins non-separating determ...

We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.

We show that all maximum length paths in a connected circular arc graph have non–empty intersection.