AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future
About this Title
Ronald L. Graham, A T&T Labs—Research, Florham Park, NJ, Jan Kratochvíl, DIMATIA Charles University, Prague, Czech Republic, Jaroslav Nešetřil, DIMATIA Charles University, Prague, Czech Republic and Fred S. Roberts, DIMACS, Rutgers University, Piscataway, NJ, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1999; Volume 49
ISBNs: 978-0-8218-0963-1 (print); 978-1-4704-4007-7 (online)
DOI: https://doi.org/10.1090/dimacs/049
MathSciNet review: MR1714676
MSC: Primary 00B25; Secondary 05-06
ReadershipTable of Contents
Front/Back Matter
Chapters
- Acyclic improper colourings of graphs with bounded degree
- Intersection graphs of Jordan arcs
- Linear and nonlinear systems: A survey
- Parameterized complexity: A framework for systematically confronting computational intractability
- On the structure of large homothetic subsets
- The complexity of an inverse shortest paths problem
- Finding minimum weighted generators of a path system
- On the distribution of sums of vectors in general position
- The generalized matching problem on partial $k$-trees
- Bases of cocycle lattices and submatrices of a Hadamard matrix
- On the maximum lengths of Davenport-Schinzel sequences
- On the minimum number of edges giving maximum oriented chromatic number
- New trends in the theory of graph colorings: Choosability and list coloring
- Topological minors in graphs of minimum degree $n$
- Reducible properties and uniquely partitionable graphs
- Induced monochromatic subconfigurations
- Density
- Spectra, graphs, and proteins. Towards understanding of protein folding
- Meaningless statements
- Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form $a^2 + kb^2$
- How to solve a Turán type extremal graph problem? (Linear decomposition)
- Oriented list colouring of undirected graphs
- On the limit values of probabilities for the first order properties of graphs
- Ramsey theory and partially ordered sets
- Generalizations of Davenport-Schinzel sequences