ABSTRACT

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects.

The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers.

The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science.

Features:

  • Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys
  • Surveys highlight open questions to inspire further research
  • Chapters are written by experts in their fields
  • Extensive bibliographies are provided at the end of each chapter

chapter Chapter 1|18 pages

Personal Reflections of the SEICCGTC: Origins and Beyond

ByK. B. Reid

part 1|1 pages

Combinatorics

chapter Chapter 2|15 pages

Some of My Favorite Problems (I)

ByRon Graham

chapter Chapter 3|17 pages

Variations on the Sequenceable Theme

ByBrian Alspach

chapter Chapter 4|18 pages

A Survey of Stack Sortable Permutations

ByMiklós Bóna

chapter Chapter 5|24 pages

Dimension for Posets and Chromatic Number for Graphs

ByWilliam T. Trotter

chapter Chapter 6|11 pages

Erdős Magic

ByJoel Spencer

part II|1 pages

Graph Theory

chapter Chapter 7|23 pages

Developments on Saturated Graphs

ByRonald J. Gould

chapter Chapter 8|18 pages

Magic Labeling Basics

ByW. D. Wallis

chapter Chapter 9|15 pages

Block Colorings of Graph Decompositions

ByE. B. Matson, C. A. Rodger

chapter Chapter 10|21 pages

Reconfiguration of Colourings and Dominating Sets in Graphs

ByC. M. Mynhardt, S. Nasserasr

chapter Chapter 11|17 pages

Edge Intersection Graphs of Paths on a Grid

ByMartin Charles Golumbic, Gila Morgenstern

part III|1 pages

Combinatorial Matrix Theory

chapter Chapter 12|25 pages

A Jaunt in Spectral Graph Theory

BySteve Butler

chapter Chapter 13|24 pages

The Inverse Eigenvalue Problem of a Graph

ByLeslie Hogben, Jephian C.-H. Lin, Bryan L. Shader

chapter Chapter 14|13 pages

Rank Functions

ByLeRoy B. Beasley

chapter Chapter 15|13 pages

Permutation Matrices and Beyond: An Essay

ByRichard A. Brualdi

part IV|1 pages

Designs, Geometry, Packing and Covering

chapter Chapter 16|8 pages

Some New Families of 2-Resolutions

ByMichael Hurley, Oscar Lopez, Spyros S. Magliveras

chapter Chapter 17|17 pages

Graphical Designs

ByDonald L. Kreher

chapter Chapter 18|15 pages

There Must be Fifty Ways to Miss a Cover

ByCharles J. Colbourn, Violet R. Syrotiuk

chapter Chapter 19|15 pages

Combinatorial Designs and Cryptography, Revisited

ByDouglas R. Stinson

chapter Chapter 20|28 pages

A Survey of Scalar Multiplication Algorithms

ByKoray Karabina

chapter Chapter 21|21 pages

Arcs, Caps, Generalisations: Results and Problems

ByJoseph A. Thas