Theory and Applications of Graphs

200 years of graph theory — A guided tour....Pages 1-9
Chromatic number and subgraphs of cayley graphs....Pages 10-22
The multicolorings of graphs and hypergraphs....Pages 23-36
Irreducible configurations and the four color conjecture....Pages 37-52
Numbered complete graphs, unusual rulers, and assorted applications....Pages 53-65
Cycles and semi-topological configurations....Pages 66-74
Graphs with unique walks, trails or paths of given lengths....Pages 75-85
Triangular imbeddings into surfaces of a join of equicardinal independent sets following an Eulerian graph....Pages 86-115
Mixed graphs of homomorphisms....Pages 116-120
On chromatic equivalence of graphs....Pages 121-131
On graphs having prescribed clique number, chromatic number, and maximum degree....Pages 132-140
Domination of undirected graphs — A survey....Pages 141-147
Some extremal problems for simple two-complexes....Pages 148-159
Various length paths in graphs....Pages 160-173
Orthogonal groups over GF(2) and related graphs....Pages 174-185
Distance matrix polynomials of trees....Pages 186-190
Odd cycles and perfect graphs....Pages 191-193
Imbeddings of metacyclic cayley graphs....Pages 194-203
On the chromatic index and the cover index of a multigraph....Pages 204-215
Pruning and depth first search....Pages 216-224
Graphs and their degree sequences: A survey....Pages 225-235
The bichromaticity of a tree....Pages 236-246
On diameter stability of graphs....Pages 247-254
Generalized pseudosurface embeddings of graphs and associated block designs....Pages 255-270
Powers of graphs, line graphs, and total graphs....Pages 271-285
The cartesian product of two graphs is stable....Pages 286-303
A note on a generalized regularity condition....Pages 304-308
Long and short walks in trees....Pages 309-313
Random clumps, graphs, and polymer solutions....Pages 314-329
Mixed ramsey numbers: Edge chromatic numbers vs. graphs....Pages 330-341
Planar and outerplanar cayley graphs of free groups....Pages 342-346
Coloring restrictions....Pages 347-352
If a hadamard matrix of order 24 has character exactly 2, its transpose is known....Pages 353-363
Cycle lengths in polytopal graphs....Pages 364-370
Subgraph connectivity numbers of a graph....Pages 371-383
Matchings in graphs III: Infinite graphs....Pages 384-393
Steinhaus graphs....Pages 394-402
Packing and covering constants for recursive trees....Pages 403-411
The minimum degree and connectivity of a graph....Pages 412-419
Generalizations of graphical parameters....Pages 420-425
Pursuit-evasion in a graph....Pages 426-441
Regularity in tournaments....Pages 442-453
On graphs of embedding range one....Pages 454-464
Non-existence of graph embeddings....Pages 465-476
Food webs, competition graphs, and the boxicity of ecological phase space....Pages 477-490
Hamiltonian persistency is periodic among iterated line digraphs....Pages 491-499
Some problems in ramsey theory....Pages 500-515
Exactly thirteen connected cubic graphs have integral spectra....Pages 516-533
A counting theorem for topological graph theory....Pages 534-544
k-Arc Hamilton graphs....Pages 545-556
Hypohamiltonian graphs and digraphs....Pages 557-571
Order preserving embeddings of aographs....Pages 572-579
Circular arc graphs: New uses and a new algorithm....Pages 580-589
Chromatic sums....Pages 590-598
Infinite cayley graphs of connectivity one....Pages 599-607
Edge-colorings of graphs — A survey....Pages 608-619
Menger and könig systems....Pages 620-635