2283 search results - page 127 / 457 » Bounds of Graph Characteristics |
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...
ALGORITHMICA
2000
13 years 8 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
SIAMDM
2000
13 years 7 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
ALGORITHMICA
2011
13 years 3 months ago
2011
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 diffe...
DM
1999
13 years 7 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...