# Discrete Mathematics

Discrete Mathematics > 1997 > 165-166 > 403-419

Discrete Mathematics > 1997 > 174 > 1-3 > 125-130

Discrete Mathematics > 1998 > 187 > 1-3 > 137-149

Discrete Mathematics > 1998 > 190 > 1-3 > 223-226

_{5}-minor-free graphs are 5-choosable.

Discrete Mathematics > 1998 > 191 > 1-3 > 65-82

Discrete Mathematics > 1999 > 195 > 1-3 > 93-101

_{1}and G

_{2}. Necessary and sufficient conditions for G

_{1}+ G

_{2}to be perfect are derived.

Discrete Mathematics > 2001 > 235 > 1-3 > 107-123

Discrete Mathematics > 2002 > 244 > 1-3 > 339-343

Discrete Mathematics > 2002 > 248 > 1-3 > 221-236

Discrete Mathematics > 2002 > 256 > 1-2 > 441-444

Discrete Mathematics > 2002 > 257 > 2-3 > 415-421

_{1},…,V

_{t}such that every set of a

_{i}+1 vertices in V

_{i}contains an edge of color i, for i=1,…,t. We combine a theorem of Deza with Ramsey's theorem to prove that, for...

Discrete Mathematics > 2003 > 262 > 1-3 > 17-25

Discrete Mathematics > 2003 > 262 > 1-3 > 221-227

Discrete Mathematics > 2003 > 269 > 1-3 > 311-314

^{*}-choosable if for every assignment L satisfying |L(v)|=k for all v V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. Let g(G) denote the girth of G and F the set of faces of G. In this paper, we prove the following results: for a graph G on surface with genus r>=2, we have: (a) G is (2,1)...

Discrete Mathematics > 2003 > 272 > 2-3 > 285-290

Discrete Mathematics > 2004 > 274 > 1-3 > 233-240

Discrete Mathematics > 2004 > 277 > 1-3 > 301-307

^{2}-g-8g

^{2}+g-6n+4g+4g

^{2}+g-6colors (for n>=(g+3)/2) in such a way that G does not contain a polychromatic face, i.e., a face whose all the vertices have mutually different colors. In particular, if the girth of an n-vertex plane graph is at least...

Discrete Mathematics > 2004 > 280 > 1-3 > 251-257

_{i}) Z

^{+}to each vertex v

_{i}V of a graph G=(V,E) so that adjacent nodes have different colors and the sum of the c(v

_{i})'s over all vertices v

_{i}V is minimized. In this note we prove that the number of colors required to attain a minimum valued sum on arbitrary interval graphs does not exceed min{n;2χ(G)-1}...

Discrete Mathematics > 2004 > 287 > 1-3 > 151-153

Discrete Mathematics > 2005 > 297 > 1-3 > 167-173