6490 results in Algorithmics, Complexity, Computer Algebra, Computational Geometry
Chapter 1 - Introduction
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp 1-12
-
- Chapter
- Export citation
Frontmatter
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp i-iv
-
- Chapter
- Export citation
Chapter 6 - Graphs of bounded tree width
- from Part 1 - The basic theory
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp 148-154
-
- Chapter
- Export citation
Chapter 14 - Almost planar completions
- from Part 2 - Definable decompositions of graphs with excluded minors
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp 361-392
-
- Chapter
- Export citation
Preface
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp ix-x
-
- Chapter
- Export citation
Symbol index
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp 531-534
-
- Chapter
- Export citation
Part 1 - The basic theory
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp 13-13
-
- Chapter
- Export citation
Chapter 2 - Background from graph theory and logic
- from Part 1 - The basic theory
-
- Book:
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Published online:
- 30 August 2017
- Print publication:
- 17 August 2017, pp 14-39
-
- Chapter
- Export citation
Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 14 August 2017, pp. 952-953
-
- Article
-
- You have access
- Export citation
The Growth Constant of Odd Cutsets in High Dimensions
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 14 August 2017, pp. 208-227
-
- Article
- Export citation
Triangle-Free Subgraphs of Random Graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 14 August 2017, pp. 141-161
-
- Article
- Export citation
Generalized Majority Colourings of Digraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 14 August 2017, pp. 850-855
-
- Article
- Export citation
Minimizing the Number of Triangular Edges
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 4 / July 2018
- Published online by Cambridge University Press:
- 14 August 2017, pp. 580-622
-
- Article
- Export citation
Anagram-Free Colourings of Graphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 4 / July 2018
- Published online by Cambridge University Press:
- 08 August 2017, pp. 623-642
-
- Article
- Export citation
Diameter of the Stochastic Mean-Field Model of Distance
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 07 August 2017, pp. 797-825
-
- Article
- Export citation
Exact Minimum Codegree Threshold for K−4-Factors
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 04 August 2017, pp. 856-885
-
- Article
- Export citation
Packing Loose Hamilton Cycles
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 6 / November 2017
- Published online by Cambridge University Press:
- 01 August 2017, pp. 839-849
-
- Article
- Export citation
Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 2 / March 2018
- Published online by Cambridge University Press:
- 01 August 2017, pp. 162-185
-
- Article
- Export citation
Correlation Bounds for Distant Parts of Factor of IID Processes
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 01 August 2017, pp. 1-20
-
- Article
- Export citation
Induced Subgraphs With Many Distinct Degrees
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 01 August 2017, pp. 110-123
-
- Article
- Export citation