3204 search results - page 33 / 641 » The Alcuin Number of a Graph |
GD
2008
Springer
13 years 9 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
GC
2002
Springer
13 years 7 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...
DM
2002
13 years 7 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...
ENDM
2002
13 years 7 months ago
2002
We prove that a claw-free, 2-connected graph with fewer than 18 vertices is traceable, and we determine all non-traceable, claw-free, 2-connected graphs with exactly 18 vertices an...
CHI
2010
ACM
14 years 2 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...