000 | 03338nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-38924-8 | ||
003 | DE-He213 | ||
005 | 20190213151611.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1984 gw | s |||| 0|eng d | ||
020 |
_a9783540389248 _9978-3-540-38924-8 |
||
024 | 7 |
_a10.1007/BFb0073099 _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 Singapore 1983 _h[electronic resource] : _bProceedings of the First Southeast Asian Graph Theory Colloquium, held in Singapore May 10–28, 1983 / _cedited by Khee Meng Koh, Hian Poh Yap. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1984. |
|
300 |
_aXVI, 336 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 ; _v1073 |
|
505 | 0 | _aOn supercompact graphs III: The edge nucleus -- Monochromatic reachability, complementary cycles, and single arc reversals in tournaments -- Cycles in abelian cayley graphs with a proscribed vertex -- On the minimum number of arcs to reverse to make a graph strongly connected -- Computational complexity of graph properties -- Lectures on the marriage theorem of aharoni, nash-williams and shelah -- A graphical colour-representation of a group -- General connectivity -- Cube factors -- Concentric subgraphs, closed subsets and dense graphs -- The binding number of product graphs -- Rigidity of multi-graphs II -- The mobility of a graph -- Random subgraphs of regular graphs -- Graph factors with given properties -- Some definitions of central structures -- Equalities involving certain graphical distributions -- A collection of sets related to the tutte polynomial of a matroid -- Are all polyominoes arbitrarily graceful? -- Generalized ramsey theory XV: Achievement and avoidance games for bipartite graphs -- On the reconstructibility of almost complete r-partite graphs -- Graphical colour-representation of an inverse semigroup -- Eulerian chains and segment reversals -- Degree sequences of connected hypergraphs and hypertrees -- The computational complexity of recognizing critical sets -- An algorithm for the directed T-immersion of a graph -- Reconstruction conjecture for square of a tree -- Cycle graphs -- Chain decompositions of graphs, 1: Abstract graphs -- Chain decompositions of graphs, 2: Surface embeddings -- Unsolved problems. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 |
_aCombinatorics. _0http://scigraph.springernature.com/things/product-market-codes/M29010 |
700 | 1 |
_aKoh, Khee Meng. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aYap, Hian Poh. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783662193716 |
776 | 0 | 8 |
_iPrinted edition: _z9783540133681 |
830 | 0 |
_aLecture Notes in Mathematics, _x0075-8434 ; _v1073 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0073099 |
912 | _aZDB-2-SMA | ||
912 | _aZDB-2-LNM | ||
912 | _aZDB-2-BAE | ||
999 |
_c11242 _d11242 |