Graphs and Discovery: DIMACS Working Group, Computer-generated Conjectures from Graph Theoretical and Chemical Databases, November 12-16, 2001, DIMACS Center, CoRE Building, Rutgers University : DIMACS Public Event, Graph Theory Day 42, November 10, 2001, DIMACS Center, CoRE Building, Rutgers UniversitySiemion Fajtlowicz In this collection from the working group meeting of November 2001, contributors formulate problems, share ideas and approaches, and plan an agenda for future interactions. Their fields included theoretical and applied computer science, statistics, discrete and non-discrete mathematics, chemistry and information science, and the topics centered on |
Contents
I | vii |
II | 1 |
III | 7 |
IV | 27 |
V | 39 |
VI | 71 |
VII | 81 |
VIII | 119 |
XIII | 231 |
XIV | 253 |
XV | 265 |
XVI | 287 |
XVII | 297 |
XVIII | 319 |
XIX | 333 |
XX | 341 |
Common terms and phrases
algebraic algorithm angle Atoms automated Beograd bounds Caporossi classes of graphs clique complement Computer Science conjecture-making conjectures of Graffiti connected graph Coordinate codes counterexamples Coxeter coordinates cubic graphs Cvetković database defined degrees of G DeLaVina denote Discrete Mathematics eigenvalue example extremal graphs faces Fajtlowicz Figure given Graffiti.pc graph G graph invariants graph theory Hansen heuristic hexagonal implemented independence number induced subgraph input integer integral graphs irr(G isomorphism leapfrog fullerene Lemma Let G list of conjectures Math Mathematics Subject Classification matroid molecules nanocell node number of edges number of vertices objects obtained output paper problem proof proved relations representation S. K. Simić search area segment sequence set of degrees Siemion Fajtlowicz signature simple connected graph split graph structure subgraphs symmetry group system GRAPH theorem trees triangle triangle-free graphs Variable neighborhood search version of Graffiti vertex vertices of G