
...shown that for every t and g there are ttough graphs of girth strictly greater thang...spectral properties of a regular graph and its expansion properties. a similar technique provides a simple construction of trianglefree graphs with independence number m on...
Published in 1995.

...cpartite tournaments are vertexpancyclic when c≥5, j. graph theory 32 (1999) 137–152] for multipartite tournaments and camion [p. camion, chemins et circuits hamiltoniens des graphes complets, c. r. acad. sci. paris 249 (1959) 2151–2152] and harary and moser [f. harary, l. moser...

...shown that for every t and g there are ttough graphs of girth strictly greater than...spectral properties of a regular graph and its expansion properties. a similar technique provides a simple construction of trianglefree graphs with independence number m on...

...results). let p be a graph property, and let c(u,v) be a condition on two nonadjacent vertices u and v of a graph g. then g+uv has property p if and only if g has property...

...an ndimensional alternating group graph can tolerate up to 4n...tolerated for the same problem and the same graph....

...deciding if, for a fixed graph h, a given graph is switchingequivalent to an hfree graph. in all cases of h...time. we give infinitely many graphs h such that the problem is npcomplete, thus solving an open problem [kratochvil, nešetřil and zýka, ann. discrete math. 51...

...of a complete npartite graph. if d is a strongly connected npartite ( n=3...those of bondy [2], guo and volkmann [4], gutin [6], moon [8], and yeo [12]....

...for two given graphs g and h the planar ramsey number pr(g,h) is the smallest integer n such that every planar graph f on n vertices either...cycles in complements of sparse graphs, we determine all planar ramsey...

...for two given graphs g and h the planar ramsey number pr(g, h ) is the smallest integer n such that every planar graph f on n vertices either...cycles in complements of sparse graphs, we determine all planar ramsey...

...an orientation of a complete graph, and in general a multipartite or cpartite tournament,is an orientation of a complete cpartite graph. in a recent article, the...the case that c = 4 and r = 2. here we will...