1395 search results - page 60 / 279 » (k, )-Distance-Hereditary Graphs |
ENDM
2006
14 years 9 months ago
2006
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
GC
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
FCS
2006
14 years 11 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
102
click to vote
COMPSAC
2011
IEEE
13 years 9 months ago
2011
IEEE
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...