000 03705nam a22004695i 4500
001 978-3-540-38679-7
003 DE-He213
005 20190213151418.0
007 cr nn 008mamaa
008 121227s1983 gw | s |||| 0|eng d
020 _a9783540386797
_9978-3-540-38679-7
024 7 _a10.1007/BFb0071604
_2doi
050 4 _aQA164-167.2
072 7 _aPBV
_2bicssc
072 7 _aMAT036000
_2bisacsh
072 7 _aPBV
_2thema
082 0 4 _a511.6
_223
245 1 0 _aGraph Theory
_h[electronic resource] :
_bProceedings of a Conference held in Łagów, Poland, February 10–13, 1981 /
_cedited by M. Borowiecki, John W. Kennedy, Maciej M. Sysło.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1983.
300 _aXII, 292 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v1018
505 0 _aOn the problem of skew curves in topology [1] -- On crossing numbers and linguistic structures -- On hamiltonian matroids -- Combinatorial properties of sign-patterns in some classes of matrices -- Disjoint paths in the plane -- Faces and components of random lattices -- On the automorphism groups of mapping graphs -- An achievement game on a toroidal board -- Embedding graphs in undirected and directed cubes -- On the connectedness of a random bipartite mapping -- A note on characteristic and permanental polynomials of multigraphs -- On the number of strictly balanced subgraphs of a random graph -- Extremal problems with excluded subgraphs in the n-cube -- Random graphs and the physical world -- A characterization of a tree by its vertex — Disconnections -- On the (k;l)-kernels -- A covering theorem for hypergraphs -- Exterior partitions of a rectangle into rectangles and their graphs -- On sequences representable by ??-regular graphs -- On middle and total graphs with coarseness number equal 1 -- Products of graphs and their applications -- The distribution of degrees in random graphs -- On a transposed square of graphs -- Some problems concerning distance and path degree sequences -- Weakly acyclic families of sets: Decomposition, reduction and augmentation -- Some recent results on planarity and duality -- A discriminatory theorem of Kuratowski subgraphs -- A note on the complexity of traversing a labyrinth -- On a spatial analogue of Kuratowski's theorem on planar graphs — An open problem -- On local properties of finite graphs -- On Halin graphs -- A note on a generalization of the Trachtenbrot-Zykov problem -- Asymmetric games on digraphs -- Thickness-critical graphs — A generalization of Kuratowski's topic -- Domatic number and bichromaticity of a graph -- A note on planarity and distance degree sequences.
650 0 _aCombinatorics.
650 1 4 _aCombinatorics.
_0http://scigraph.springernature.com/things/product-market-codes/M29010
700 1 _aBorowiecki, M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKennedy, John W.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSysło, Maciej M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783662166086
776 0 8 _iPrinted edition:
_z9783540126874
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v1018
856 4 0 _uhttps://doi.org/10.1007/BFb0071604
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c10578
_d10578