Sciweavers

147 search results - page 23 / 30
» Vertex partitions of chordal graphs
Sort
View
CCCG
2009
13 years 9 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
HICSS
2008
IEEE
114views Biometrics» more  HICSS 2008»
14 years 3 months ago
On Structural Analysis of Large Networks
Containing much valuable information, networks such as the World Wide Web, social networks and metabolic networks draw increasingly attention in scientific communities. Network cl...
Nurcan Yuruk, Xiaowei Xu, Thomas A. J. Schweiger
COCOON
2003
Springer
14 years 2 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Jung-Heum Park, Hee-Chul Kim
COMBINATORICA
2011
12 years 8 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
ICTCS
2005
Springer
14 years 2 months ago
Weighted Coloring: Further Complexity and Approximability Results
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
Bruno Escoffier, Jérôme Monnot, Vange...