8652 results in Discrete Mathematics, Information Theory and Coding
On the Number of Elements in Matroids with Small Circuits or Cocircuits
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 6 / November 1999
- Published online by Cambridge University Press:
- 01 November 1999, pp. 529-537
-
- Article
- Export citation
Searches on a Binary Tree with Random Edge-Weights
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 6 / November 1999
- Published online by Cambridge University Press:
- 01 November 1999, pp. 555-565
-
- Article
- Export citation
On Dominating Sets and Independent Sets of Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 6 / November 1999
- Published online by Cambridge University Press:
- 01 November 1999, pp. 547-553
-
- Article
- Export citation
2 - Independence Structures
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 39-79
-
- Chapter
- Export citation
Contents
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp vii-viii
-
- Chapter
- Export citation
Preface
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp ix-x
-
- Chapter
- Export citation
1 - Two Dual Structures of a Graph
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 1-38
-
- Chapter
- Export citation
Bibliography
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 168-173
-
- Chapter
- Export citation
Frontmatter
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp i-vi
-
- Chapter
- Export citation
Index
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 174-176
-
- Chapter
- Export citation
5 - Maximally Distant Pairs of Trees
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 141-167
-
- Chapter
- Export citation
4 - Pairs of Trees
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 115-140
-
- Chapter
- Export citation
3 - Basoids
-
- Book:
- Hybrid Graph Theory and Network Analysis
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999, pp 80-114
-
- Chapter
- Export citation
Hybrid Graph Theory and Network Analysis
-
- Published online:
- 20 March 2010
- Print publication:
- 02 September 1999
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 467-472
-
- Article
- Export citation
On a Conjecture by Eriksson Concerning Overlap in Strings
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 429-440
-
- Article
- Export citation
On the Number of Simple Cycles in Planar Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 397-405
-
- Article
- Export citation
The Poisson–Dirichlet Distribution and the Scale-Invariant Poisson Process
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 407-416
-
- Article
- Export citation
A Grötzsch-Type Theorem for List Colourings with Impropriety One
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 493-507
-
- Article
- Export citation
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
-
- Journal:
- Combinatorics, Probability and Computing / Volume 8 / Issue 5 / September 1999
- Published online by Cambridge University Press:
- 01 September 1999, pp. 441-460
-
- Article
- Export citation