3268 search results - page 130 / 654 » The hub number of a graph |
152
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
161
click to vote
DAM
2007
15 years 6 months ago
2007
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
160
click to vote
IPL
2007
15 years 6 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
156
click to vote
JCO
2007
15 years 6 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
166
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...