Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
Author(s)
Bibliographic Information
Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity
（Annals of discrete mathematics, 51）
North-Holland, 1992
Available at / 34 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Prachatice||199092037094
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
dc20:511/n3692070235892
-
No Libraries matched.
- Remove all filters.
Note
The Fourth Czechoslovak Symposium on Combinatorics held in Prachatice in South Bohemia in 1990
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
Two Sequences of 2-Regular Graceful Graphs Consisting of 4-gons (J. Abrham, A. Kotzig#). A Survey of Self-Dual Polyhedra (D. Archdeacon). On Magic Labellings of Convex Polytopes (M. Baca). A Packing Problem and Geometrical Series (V. Balint). On the Bananas Surface B2 (R. Bodendiek, K. Wagner). Structural Properties and Colorings of Plane Graphs (O.V. Borodin). The Binding Number of Graphs (M. Borowiecki). Note on Algorithmic Solvability of Trahtenbrot-Zykov Problem (P. Bugata). Cartesian Dimensions of a Graph (G. Burosch, P. V. Ceccherini). The Steiner Minimal Tree Problem in L2p (D. Cieslik). On k -Connected Subgraphs of the Hypercube (T. Dvorak). On Some of My Favourite Problems in Various Branches of Combinatorics (P. Erdos). Realizability of Some Starlike Trees (D. Froncek). The Construction of All Configurations (124, 163) (H. Gropp). (p,q)-realizability of Integer Sequences with Respect to Mobius Strip (M. Hornak). Vertex Location Problems (O. Hudec). On Generation of a Class of Flowgraphs (A.J.C. Hurkens, C.A.J. Hurkens, R.W. Whitty). The Weight of a Graph (J. Ivanco). On the Kauffman Polynomial of Planar Matroids (F. Jaeger). On Symmetry Groups of Selfdual Convex Polyhedra (S. Jendrol). A Remark on 2- (u,kappa,lambda) Designs (V. Jurak). On a New Class of Intersection Graphs (M. Koebe). Asymptotic Normality of Isolated Edges in Random Subgraphs of the n -Cube (U. Konieczna). On Bounds of the Bisection Width of Cubic Graphs (A.V. Kostochka, L.S. Mel'nikov). On Random Cubical Graphs (A.V. Kostochka, A.A. Sapozhenko, K. Weber). On the Computational Complexity of Seidel's Switching (J. Kratochvil, J. Nesetril, O. Zyka). The Harmonious Chromatic Number of a Graph (A. Kundrik). Arboricity and Star Arboricity of Graphs (A. Kurek). Extended 4-Profiles of Hadamard Matrices (C. Lin, W.D. Wallis, Z. Lie). Good Family Packing (M. Loebl, S. Poljak). Solution of an Extremal Problem Concerning Edge-Partitions of Graphs (Z. Lonc). Balanced Extensions of Spare Graphs (T. Luczak, A. Rucinski). Two Results on Antisocial Families of Balls (A. Malnic, B. Mohar). Hamiltonicity of Vertex-transitive pq -Graphs (D. Marusic). On Nodes of Given Out-Degree in Random Trees (A. Meir, J.W. Moon). All Leaves and Excesses are Realizable for k =3 and All lambda (E. Mendelsohn, N. Shalaby, S. Hao). The Binding Number of k -Trees (D. Michalak). An Extension of Brook's Theorem (P. Mihok). On Sectors in a Connected Graph (L. Nebesky). Irreconstructability of Finite Undirected Graphs from Large Subgraphs (V. Nydl). On Inefficient Proofs of Existence and Complexity Classes (C.H. Papadimitriou). Optimal Coteries on a Network (C.H. Papadimitriou, M. Sideri). On Some Heuristics for the Steiner Problem in Graphs (J. Plesnik). Minimax Results and Polynomial Algorithms in VLSI Routing (A. Recski). Critical Perfect Systems of Difference Sets (D.G. Rogers). Some Operations (Not) Preserving the Integer Rounding Property (A.
by "Nielsen BookData"