3211 search results - page 5 / 643 » On the Grundy Number of a Graph |
173
click to vote
DCG
2008
15 years 6 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
187
click to vote
JCT
2011
14 years 9 months ago
2011
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
154
click to vote
APAL
1998
15 years 6 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
192
click to vote
ISAAC
2007
Springer
16 years 23 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
160
click to vote
NETWORKS
2010
15 years 5 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.