20 search results - page 3 / 4 » endm 2006 |
ENDM
2006
14 years 10 months ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks
ENDM
2006
14 years 10 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
14 years 10 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
14 years 10 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...
ENDM
2006
14 years 10 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...