Sciweavers

483 search results - page 26 / 97
» On perfectness of sums of graphs
Sort
View
JGT
2006
114views more  JGT 2006»
14 years 10 months ago
The chromatic covering number of a graph
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
Reza Naserasr, Claude Tardif
DM
1999
75views more  DM 1999»
14 years 10 months ago
Real and integer domination in graphs
For an arbitrary subset P of the reals, we define a function f: V P to be a Pdominating function of graph G = (V, E) if the sum of the function values over any
Wayne Goddard, Michael A. Henning
ARSCOM
2007
81views more  ARSCOM 2007»
14 years 11 months ago
Graphic Sequences with a Realization Containing a Friendship Graph
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
Michael Ferrara, Ronald J. Gould, John R. Schmitt
DCG
2007
83views more  DCG 2007»
14 years 10 months ago
The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs
Weprovethatthegenusoftheboundaryofadigitalimageispreciselyhalfofthe sum of the cycle ranks of three particular graphs: the “foreground graph” and “background graph,” which ...
Lowell Abrams, Donniell E. Fishkind
CORR
2010
Springer
60views Education» more  CORR 2010»
14 years 11 months ago
Hitting time results for Maker-Breaker games
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael...