Sciweavers

7796 search results - page 24 / 1560
» On Generalized Schur Numbers
Sort
View
81
Voted
JUCS
2006
94views more  JUCS 2006»
15 years 21 days ago
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
Tobias Riege, Jörg Rothe
117
Voted
DAM
1999
105views more  DAM 1999»
15 years 13 days ago
The b-chromatic Number of a Graph
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
Robert W. Irving, David Manlove
EUSFLAT
2009
166views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
Approximations by Interval, Triangular and Trapezoidal Fuzzy Numbers
Abstract-- Recently, many scholars investigated interval, triangular, and trapezoidal approximations of fuzzy numbers. These researches can be grouped into two classes: the Euclide...
Chi-Tsuen Yeh
COMPGEOM
2005
ACM
15 years 2 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser
109
Voted
DM
2008
177views more  DM 2008»
15 years 25 days ago
The independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...