3204 search results - page 8 / 641 » The Alcuin Number of a Graph |
DM
2000
13 years 7 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple
ALGORITHMICA
2011
13 years 2 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
SWAT
2010
Springer
14 years 28 days ago
2010
Springer
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...