110 search results - page 9 / 22 » endm 2010 |
ENDM
2010
13 years 6 months ago
2010
Electronic Notes in Discrete Mathematics 36 (2010) 1065
ENDM
2010
13 years 6 months ago
2010
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr
ENDM
2006
13 years 6 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...
ENDM
2006
13 years 6 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
ENDM
2006
13 years 6 months ago
2006
We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...