000 03144nam a22004575i 4500
001 978-3-540-36161-9
003 DE-He213
005 20190213151320.0
007 cr nn 008mamaa
008 121227s1969 gw | s |||| 0|eng d
020 _a9783540361619
_9978-3-540-36161-9
024 7 _a10.1007/BFb0060099
_2doi
050 4 _aQA1-939
072 7 _aPB
_2bicssc
072 7 _aMAT000000
_2bisacsh
072 7 _aPB
_2thema
082 0 4 _a510
_223
245 1 4 _aThe Many Facets of Graph Theory
_h[electronic resource] :
_bProceedings of the Conference held at Western Michigan University, Kalamazoo / MI., October 31 – November 2, 1968 /
_cedited by G. Chartrand, S. F. Kapoor.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1969.
300 _aVIII, 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 ;
_v110
505 0 _aGraphs and binary relations -- Graph theory and finite projective planes -- On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs -- Analogues of ramsey numbers -- A survey of packings and coverings of graphs -- Section graphs for finite permutation groups -- Nearly regular polyhedra with two exceptional faces -- Some applications of graph theory to number theory -- On the number of cycles in permutation graphs -- A note on a category of graphs -- Reconstructing graphs -- Incidence patterns of graphs and complexes -- A many-facetted problem of zarankiewicz -- Graph theory and lie algebra -- Matroids versus graphs -- On classes of graphs defined by special cutsets of lines -- Rank 3 graphs -- Variations on a theorem of Pósa -- Critically and minimally n-connected graphs -- On reconstruction of graphs -- The cohesive strength of graphs -- Hypo-properties in graphs -- An extension of graphs -- Hamiltonian circuits in graphs and digraphs -- On the density and chromatic numbers of graphs -- Methods for the enumeration of multigraphs -- Characterizations of 2-dimensional trees -- A combinatorial identity -- An application of graph theory to social psychology -- A topological influence: Homeomorphically irreducible graphs -- Graph theory and “Instant Insanity” -- Arc digraphs and traversability.
650 0 _aMathematics.
650 1 4 _aMathematics, general.
_0http://scigraph.springernature.com/things/product-market-codes/M00009
700 1 _aChartrand, G.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKapoor, S. F.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540046295
776 0 8 _iPrinted edition:
_z9783662200261
830 0 _aLecture Notes in Mathematics,
_x0075-8434 ;
_v110
856 4 0 _uhttps://doi.org/10.1007/BFb0060099
912 _aZDB-2-SMA
912 _aZDB-2-LNM
912 _aZDB-2-BAE
999 _c10250
_d10250