15 results
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 33 / Issue 2 / March 2024
- Published online by Cambridge University Press:
- 10 November 2023, pp. 179-195
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
What characterizes helpful personal practice in psychotherapy training? Results of an online survey
-
- Journal:
- Behavioural and Cognitive Psychotherapy / Volume 51 / Issue 1 / January 2023
- Published online by Cambridge University Press:
- 25 October 2022, pp. 74-86
- Print publication:
- January 2023
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
A review of source models to further the understanding of the seismicity of the Groningen field
- Part of
-
- Journal:
- Netherlands Journal of Geosciences / Volume 101 / 2022
- Published online by Cambridge University Press:
- 27 May 2022, e11
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Group cohesion in group-based personal practice
-
- Journal:
- Behavioural and Cognitive Psychotherapy / Volume 50 / Issue 1 / January 2022
- Published online by Cambridge University Press:
- 27 September 2021, pp. 28-39
- Print publication:
- January 2022
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
6 - Extremal aspects of graph and hypergraph decomposition problems
-
-
- Book:
- Surveys in Combinatorics 2021
- Published online:
- 08 June 2021
- Print publication:
- 24 June 2021, pp 235-266
-
- Chapter
- Export citation
Counting Hamilton cycles in Dirac hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 17 December 2020, pp. 631-653
-
- Article
- Export citation
Dirac’s theorem for random regular graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 1 / January 2021
- Published online by Cambridge University Press:
- 28 August 2020, pp. 17-36
-
- Article
- Export citation
Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree
-
- Journal:
- Combinatorics, Probability and Computing / Volume 22 / Issue 3 / May 2013
- Published online by Cambridge University Press:
- 20 December 2012, pp. 394-416
-
- Article
- Export citation
6 - Embedding large subgraphs into dense graphs
-
-
- Book:
- Surveys in Combinatorics 2009
- Published online:
- 05 May 2013
- Print publication:
- 09 July 2009, pp 137-168
-
- Chapter
- Export citation
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 5 / September 2008
- Published online by Cambridge University Press:
- 01 September 2008, pp. 689-709
-
- Article
- Export citation
Linkedness and Ordered Cycles in Digraphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 3 / May 2008
- Published online by Cambridge University Press:
- 01 May 2008, pp. 411-422
-
- Article
- Export citation
Packings in Dense Regular Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 14 / Issue 3 / May 2005
- Published online by Cambridge University Press:
- 11 April 2005, pp. 325-337
-
- Article
- Export citation
Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth
-
- Journal:
- Combinatorics, Probability and Computing / Volume 13 / Issue 3 / May 2004
- Published online by Cambridge University Press:
- 28 April 2004, pp. 361-371
-
- Article
- Export citation
Large Topological Cliques in Graphs Without a 4-Cycle
-
- Journal:
- Combinatorics, Probability and Computing / Volume 13 / Issue 1 / January 2004
- Published online by Cambridge University Press:
- 19 January 2004, pp. 93-102
-
- Article
- Export citation
On well-quasi-ordering infinite trees – Nash–Williams's theorem revisited
-
- Journal:
- Mathematical Proceedings of the Cambridge Philosophical Society / Volume 130 / Issue 3 / May 2001
- Published online by Cambridge University Press:
- 18 May 2001, pp. 401-408
- Print publication:
- May 2001
-
- Article
- Export citation