Sciweavers

Share
GC
2011
Springer
7 years 11 months ago
Minimum Clique Partition in Unit Disk Graphs
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
Adrian Dumitrescu, János Pach
GC
2011
Springer
7 years 11 months ago
A Note on the Complexity of Real Algebraic Hypersurfaces
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
Michael Kerber, Michael Sagraloff
GC
2011
Springer
7 years 11 months ago
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine,...
GC
2011
Springer
7 years 11 months ago
Automorphic Decompositions of Graphs
ties: Graded for Calculus III and substituted in Abstract Algebra • Adjunct Instructor, Tri-County Technical College (2005) (864) 646-1368 Courses Taught: Intermediate Algebra, C...
Robert A. Beeler, Robert E. Jamison
GC
2011
Springer
8 years 3 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...
GC
2011
Springer
8 years 3 months ago
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
Tao Jiang, Michael Salerno
GC
2011
Springer
8 years 3 months ago
The Cycle Discrepancy of Three-Regular Graphs
Sarmad Abbasi, Laeeq Aslam
books