Graph theory : proceedings of a conference held in Łagów, Poland, February 10-13, 1981 / M. Borowiecki, J.W. Kennedy and M.M. Sysło

Contents: Kasimierz Kuratowski, On the problem of skew curves in topology (pp. 1–13); Gary S. Bloom, John W. Kennedy and Louis V. Quintas, On crossing numbers and linguistic structures (pp. 14–22); Mieczysław Borowiecki, On Hamiltonian matroids (pp. 23–27); Miroslav Fiedler, Combinatorial properties of sign-patterns in some classes of matrices (pp. 28–32); András Frank, Disjoint paths in the plane (pp. 33–37); O. Frank, Faces and components of random lattices (pp. 38–45); Jarosław Gela, On the automorphism groups of mapping graphs (pp. 46–54); Frank Harary, An achievement game on a toroidal board (pp. 55–59); Ivan Havel, Embedding graphs in undirected and directed cubes (pp. 60–68); Jerzy Jaworski, On the connectedness of a random bipartite mapping (pp. 69–74); Mieczysław Borowiecki and Tadeusz Jóźwiak, A note on characteristic and permanental polynomials of multigraphs (pp. 75–78); Michał Karoński and Andrzej Ruciński, On the number of strictly balanced subgraphs of a random graph (pp. 79–83); G. O. H. Katona and T. G. Tarján, Extremal problems with excluded subgraphs in the n-cube (pp. 84–93); Gary S. Bloom, John W. Kennedy, Małgorzata T. Mandziuk and Louis V. Quintas, Random graphs and the physical world (pp. 94–110); Antoni Kośliński, A characterization of a tree by its vertex-disconnections (pp. 111–113); Maria Kwaśnik, On the (k;l)-kernels (pp. 114–121); J. Lehel, A covering theorem for hypergraphs (pp. 122–124); Józef Magiera, Exterior partitions of a rectangle into rectangles and their graphs (pp. 125–130); Zofia Majcher, On sequences representable by Γ−-regular graphs (pp. 131–138); Danuta Michalak, On middle and total graphs with coarseness number equal to 1 (pp. 139–150); Jaroslaw Nešetřil and Vojtěch Rödl, Products of graphs and their applications (pp. 151–160); Zbigniew Palka, The distribution of degrees in random graphs (pp. 161–169); J. Płonka, On a transposed square of graphs (pp. 170–178); Gary S. Bloom, John W. Kennedy and Louis V. Quintas, Some problems concerning distance and path degree sequences (pp. 179–190); Jacek Rajkow-Krzywicki, Weakly acyclic families of sets: decomposition, reduction and augmentation (pp. 191–198); András Recski, Some recent results on planarity and duality (pp. 199–213); H. de Fraysseix and P. Rosenstiehl, A discriminatory theorem of Kuratowski subgraphs (pp. 214–222); Wojciech Rytter, A note on the complexity of traversing a labyrinth (pp. 223–229); Horst Sachs, On a spatial analogue of Kuratowski's theorem on planar graphs—an open problem (pp. 230–241); J. Sedláček, On local properties of finite graphs (pp. 242–247); Maciej M. Sysło and Andrzej Proskurowski, On Halin graphs (pp. 248–256); Lucjan Szamkołowicz, A note on a generalization of the Trachtenbrot-Zykov problem (pp. 257–259); Jerzy Topp, Asymmetric games on digraphs (pp. 260–265); Walter Wessel, Thickness-critical graphs—a generalization of Kuratowski's topic (pp. 266–277); Bohdan Zelinka, Domatic number and bichromaticity of a graph (pp. 278–285); Fay Halberstam and Jerzy Żak, A note on planarity and distance degree sequences (pp. 286–289).