#### Filter Results:

#### Publication Year

2012

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work of researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and… (More)

An edge-coloring of a graph G with colors 1,. .. , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. In this note we prove that K 1,m,n is interval colorable if… (More)

If a graph G has n ≥ 4k vertices and more than n 2 /4 edges, then it contains a copy of C 2k+1. But can we guarantee something stronger than just a single copy? In 1992, Erd˝ os, Faudree and Rousseau showed that the number of edges that occur in a triangle of such a G is at least 2 n/2 + 1, and this bound is tight. They also showed that the minimum number… (More)

- Evangelos Kranakis, Gonzalo Navarro, Edgar Chávez, Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen +243 others
- 2016

broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not… (More)

In this paper, we study (1 : b) Avoider-Enforcer games played on the edge set of the complete graph on n vertices. For every constant k ≥ 3 we analyse the k-star game, where Avoider tries to avoid claiming k edges incident to the same vertex. We analyse both versions of Avoider-Enforcer games – the strict and the monotone – and for each provide explicit… (More)

We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through kth powers of a directed path, 1 ≤ k < n. The vertices of a kth power of a directed path of a known length n are exposed one by one to a selector in some random order. At any time the selector can… (More)

- ‹
- 1
- ›