UID:
almahu_9949697607502882
Format:
1 online resource (411 p.)
ISBN:
1-281-77891-5
,
9786611778910
,
0-08-086791-X
Series Statement:
Annals of discrete mathematics ; 51
Content:
This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.
Note:
Description based upon print version of record.
,
Front Cover; Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity; Copyright Page; Contents; Preface; Chapter 1. Two Sequences of 2-Regular Graceful Graphs Consisting of 4-gons; Chapter 2. A Survey of Self-Dual Polyhedra; Chapter 3. On Magic Labellings of Convex Polytopes; Chapter 4. A Packing Problem and Geometrical Series; Chapter 5. On the Bananas Surface B2; Chapter 6. Structural Properties and Colorings of Plane Graphs; Chapter 7. The Binding Number of Graphs; Chapter 8. Note on Algorithmic Solvability of Trahtenbrot-Zykov Problem
,
Chapter 9. Cartesian Dimensions of a GraphChapter 10. The Steiner Minimal Tree Problem in L2p; Chapter 11. On k-Connected Subgraphs of the Hypercube; Chapter 12. On Some of My Favourite Problems in Various Branches of Combinatorics; Chapter 13. Realizability of Some Starlike Trees; Chapter 14. The Construction of All Configurations (124,163); Chapter 15. (p, q)-realizability of Integer Sequences with Respect to Möbius Strip; Chapter 16. Vertex Location Problems; Chapter 17. On Generation of a Class of Flowgraphs; Chapter 18. The Weight of a Graph
,
Chapter 19. On the Kauffman Polynomial of Planar MatroidsChapter 20. On Symmetry Groups of Selfdual Convex Polyhedra; Chapter 21. A Remark on 2-(v,k,A) Designs; Chapter 22. On a New Class of Intersection Graphs; Chapter 23. Asymptotic Normality of Isolated Edges in Random Subgraphs of the n-Cube; Chapter 24. On Bounds of the Bisection Width of Cubic Graphs; Chapter 25. On Random Cubical Graphs; Chapter 26. On the Computational Complexity of Seidel's Switching; Chapter 27. The Harmonious Chromatic Number of a Graph; Chapter 28. Arboricity and Star Arboricity of Graphs
,
Chapter 29. Extended 4-Profiles of Hadamard MatricesChapter 30. Good Family Packing; Chapter 31. Solution of an Extremal Problem Concerning Edge-Partitions of Graphs; Chapter 32. Balanced Extensions of Spare Graphs; Chapter 33. Two Results on Antisocial Families of Balls; Chapter 34. Hamiltonicity of Vertex-transitive pq-Graphs; Chapter 35. On Nodes of Given Out-Degree in Random Trees; Chapter 36. All Leaves and Excesses Are Realizable for k = 3 and All A; Chapter 37. The Binding Number of k-Trees; Chapter 38. An Extension of Brook's Theorem; Chapter 39. On Sectors in a Connected Graph
,
Chapter 40. lrreconstructability of Finite Undirected Graphs from Large SubgraphsChapter 41. On Inefficient Proofs of Existence and Complexity Classes; Chapter 42. Optimal Coteries on a Network; Chapter 43. On Some Heuristics for the Steiner Problem in Graphs; Chapter 44. Cycle Covers of Graphs with a Nowhere-Zero 4-Flow (Abstract); Chapter 45. Minimax Results and Polynomial Algorithms in VLSl Routing; Chapter 46. Critical Perfect Systems of Difference Sets; Chapter 47. Some Operations (Not) Preserving the Integer Rounding Property
,
Chapter 48. Optimal Embedding of a Tree into an Interval Graph in Linear Time
,
English
Additional Edition:
ISBN 0-444-89543-4
Language:
English
Bookmarklink