311 search results - page 3 / 63 » Graph Classes Between Parity and Distance-hereditary Graphs |
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
ENDM
2006
13 years 7 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
EJC
2008
13 years 6 months ago
2008
Let be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of . This paper aims to characterize (, G) under the conditions that the quotient gr...
ECCC
2007
13 years 7 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...