Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
Graphs and Combinatorics. 21:343-354
Let h(n,p) be the minimum integer such that every edge-colouring of the complete graph of order n, using exactly h(n,p) colours, produces at least one cycle of order p having all its edges of different colours. In this paper the value of h(n,p) is de
Publikováno v:
Graphs and Combinatorics. 20:223-231
For any set P of n points in general position in the plane there is a convex decomposition of P with at most * elements. Moreover, any minimal convex decomposition of such a set P has at most * elements, where k is the number of points in the boundar
Publikováno v:
Graphs and Combinatorics. 19:533-536
Let G=(V(G),E(G)) be a multigraph with multiple loops allowed, and V 0⊆V(G). We define h(G,V 0) to be the minimum integer k such that for every edge-colouring of G using exactly k colours, all the edges incident with some vertex in V 0 receive diff
Autor:
Victor Neumann-Lara, F. Larrión
Publikováno v:
Graphs and Combinatorics. 13:263-266
We present an infinite set A of finite graphs such that for any graph G e A the order | V(k n (G))| of the n-th iterated clique graph k n (G) is a linear function of n. We also give examples of graphs G such that | V(k n(G))| is a polynomial of any g
Autor:
Victor Neumann-Lara
Publikováno v:
Graphs and Combinatorics. 10:363-366
In [3], Reid and Parker proved the following interesting theorem: If k?5 and n ? 7.2k-4, then every tournament Tn of order n contains a TTk, i.e. a transitive subtournament of order k, improving a well known result of Stearns and disproving a conject