3268 search results - page 77 / 654 » The hub number of a graph |
189
click to vote
ALGORITHMICA
2002
15 years 6 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
191
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
179
click to vote
DM
2002
15 years 6 months ago
2002
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
166
click to vote
ARSCOM
2006
15 years 6 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
176
click to vote
ARSCOM
2005
15 years 6 months ago
2005
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...