#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1983

2018

- This year (1)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Fred C. Holroyd, John M. Talbot
- Discrete Mathematics
- 2005

For a graph G, vertex v of G and integer r â‰¥ 1, we denote the family of independent r-sets of V (G) by I(r)(G) and the subfamily {A âˆˆ I(r)(G) : v âˆˆ A} by I v (G); such a subfamily is called a star.â€¦ (More)

- Fred C. Holroyd, Claire Spencer, John M. Talbot
- Discrete Mathematics
- 2005

For a graph G and integer r â‰¥ 1 we denote the collection of independent r-sets of G by I (r)(G). If v âˆˆ V (G) then I (r) v (G) is the collection of all independent r-sets containing v. A graph G, isâ€¦ (More)

- A. Johnson, Fred C. Holroyd, S. Stahl
- Journal of Graph Theory
- 1997

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by Ï‡âˆ—â€¦ (More)

- Sarah B. M. Bell, Bernard M. Diaz, Fred C. Holroyd, M. J. Jackson
- Image Vision Comput.
- 1983

- Fred C. Holroyd, Martin Koviera
- J. Comb. Theory, Ser. B
- 2004

Let S be a Steiner triple system and G a cubic graph. We say that G is S-colourable if its edges can be coloured so that at each vertex the incident colours form a triple of S. We show that if S is aâ€¦ (More)

- Peter Borg, Fred C. Holroyd
- Discrete Mathematics
- 2009

Let G = (V,E) be a graph. Let IG be the family of all independent sets of G. For r â‰¥ 1, let I G := {I âˆˆ IG : |I| = r}. For v âˆˆ V (G), let I (r) G (v) denote the star {A âˆˆ I G : v âˆˆ A}. G is said toâ€¦ (More)

- Fred C. Holroyd, David C. Mason
- Image Vision Comput.
- 1990

- Peter Borg, Fred C. Holroyd
- Discrete Mathematics
- 2009

Let F be a family of subsets of a finite set V . The star of F at v âˆˆ V is the sub-family {A âˆˆ F : v âˆˆ A}. We denote the sub-family {A âˆˆ F : |A| = r} by F (r). A double partition P of a finite set Vâ€¦ (More)

- Anthony J. W. Hilton, Fred C. Holroyd, Cheng Zhao
- Discrete Mathematics
- 2001

In this paper we show that under some fairly general conditions the Overfull Conjecture about the chromatic index of a graph G implies the Conformability Conjecture about the total chromatic numberâ€¦ (More)

- Jini Williams, Fred C. Holroyd
- Discrete Mathematics
- 2008

A semi-total colouring, , of a graph G with maximum degree uses + 1 colours and has the properties of a total colouring except that adjacent vertices need not have distinct colours. A beta edge is anâ€¦ (More)