Sciweavers

4913 search results - page 150 / 983
» Results and Perspectives of the G
Sort
View
DM
1998
68views more  DM 1998»
15 years 6 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
COMGEO
2008
ACM
15 years 6 months ago
Encompassing colored planar straight line graphs
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...
ANOR
2005
160views more  ANOR 2005»
15 years 6 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
BMCBI
2010
142views more  BMCBI 2010»
15 years 3 months ago
Comparison of Beta-value and M-value methods for quantifying methylation levels by microarray analysis
Background: High-throughput profiling of DNA methylation status of CpG islands is crucial to understand the epigenetic regulation of genes. The microarray-based Infinium methylati...
Pan Du, Xiao Zhang, Chiang-Ching Huang, Nadereh Ja...
DM
2000
150views more  DM 2000»
15 years 6 months ago
A note on generalized chromatic number and generalized girth
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
Béla Bollobás, Douglas B. West