#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2015

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yair Caro, Josef Lauri, Christina Zarb
- Discussiones Mathematicae Graph Theory
- 2015

A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours. This notion, introduced by Bujtás and Tuza, generalises both classical hypergraph colourings and more general Voloshin colourings of… (More)

- Yair Caro, Raphael Yuster, Christina Zarb
- Discrete Mathematics
- 2017

- Yair Caro, Josef Lauri, Christina Zarb
- Discussiones Mathematicae Graph Theory
- 2015

A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G). This parameter, inspired by the well-known Erd˝ os-Szekeres theorem, has been studied by the authors in two… (More)

- Yair Caro, Josef Lauri, Christina Zarb
- Discrete Applied Mathematics
- 2015

- Yair Caro, Josef Lauri, Christina Zarb
- Discrete Mathematics
- 2016

- Yair Caro, Josef Lauri, Christina Zarb
- Australasian J. Combinatorics
- 2015

Let σ be a partition of the positive integer r. A σ-hypergraph H = H(n, r, q|σ) is an r-uniform hypergraph on nq vertices which are partitioned into n classes V1, V2, . . . , Vn each containing q vertices. An r-subset K of vertices is an edge of the hypergraph if the partition of r formed by the non-zero cardinalities |K ∩ Vi|, 1 ≤ i ≤ n, is σ. In earlier… (More)

- ‹
- 1
- ›