106 search results - page 8 / 22 » Edge clique graphs and some classes of chordal graphs |
108
Voted
COMBINATORICS
2006
14 years 11 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
101
click to vote
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
127
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
85
Voted
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
ENDM
2007
14 years 11 months ago
2007
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...