bokomslag Graph Theory and Applications
Vetenskap & teknik

Graph Theory and Applications

Y Alavi D R Lick A T White

Pocket

539:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-12 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 329 sidor
  • 1972
Tripartite graphs to analyze the interconnection of networks.- Minimal regular major maps with proper 4-rings.- Total graphs.- A census of ball and disk dissections.- Network models for maximization of heat transfer under weight constraints.- The "Graph Theory" of the Greek Alphabet.- The number of partial order graphs.- Estimating the connectivity of a graph.- On problems of Moser and Hanson.- The role of graph theory in some sieve arguments of probability theory.- The pfaffian and 1-factors of graphs II.- On embedding graphs in squashed cubes.- Crossing numbers of graphs.- Recent results on generalized Ramsey theory for graphs.- Line graphs of triangleless graphs and iterated clique graphs.- Line digraphs.- On limit points of spectral radii of non-negative symmetric integral matrices.- Which generalized prisms admit H-circuits?.- The chromatic number of triangle-free graphs.- Planarity of Cayley diagrams.- Hamiltonian and Eulerian properties of entire graphs.- Two problems on random trees.- On the girth and genus of a graph.- Variations of the cell growth problem.- On the toughness of a graph.- On the cyclic connectivity of planar graphs.- Some recent results in chemical enumeration.- Upper and lower imbeddable graphs.- Triangular embeddings of graphs.- Progress on the problem of eccentric hosts.- Magic sets.- The strong perfect graph conjecture and an application to a municipal routing problem.- On graphical regular representations of Cn Q.- Planar graphs and matroids.

  • Författare: Y Alavi, D R Lick, A T White
  • Format: Pocket/Paperback
  • ISBN: 9783540060963
  • Språk: Engelska
  • Antal sidor: 329
  • Utgivningsdatum: 1972-12-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K