Fr. 49.90

Graph Theory and Applications - Proceedings of the Conference at Western Michigan University, May 10 - 13, 1972

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more










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.

List of contents

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.

Product details

Assisted by Y. Alavi (Editor), D. R. Lick (Editor), A. T. White (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 29.06.2009
 
EAN 9783540060963
ISBN 978-3-540-06096-3
No. of pages 329
Dimensions 175 mm x 233 mm x 19 mm
Weight 544 g
Illustrations VI, 329 p.
Series Lecture Notes in Mathematics
Lecture Notes in Mathematics
Subject Natural sciences, medicine, IT, technology > Mathematics > Arithmetic, algebra

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.