Linguists often represent the relationships between words in a collection of text as an undirected graph G = (V, E), were V is the vocabulary and vertices are adjacent in G if and...
Pranav Anand, Henry Escuadro, Ralucca Gera, Craig ...
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...