650 search results - page 12 / 130 » Positive graphs |
JGAA
2010
14 years 8 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
EJC
2008
14 years 9 months ago
2008
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
SIAMDM
2010
14 years 4 months ago
2010
Let d = d1 d2
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...