MARC Record from harvard_bibliographic_metadata

LEADER: 06277pam a2200373 a 4500
001 000523410-7
005 20020606090541.3
008 850515s1985 nyua b 10000 eng
010 $a 85009565
020 $a0471816353 :$c$49.95 (est.)
035 0 $aocm12135473
040 $aDLC$cDLC
050 00 $aQA166$b.G733 1985
245 00 $aGraph theory with applications to algorithms and computer science /$cedited by Y. Alavi ... [et al.].
260 0 $aNew York :$bWiley,$cc1985.
300 $axv, 810 p. :$bill. ;$c24 cm.
500 $a"Proceedings of the Fifth Quadrennial International Conference on the Theory and Applications of Graphs with special emphasis on algorithms and computer science applications, held at Western Michigan University in Kalamazoo, Michigan, June 4-8, 1984"--Pref.
500 $a"A Wiley-Interscience publication."
504 $aIncludes bibliographies.
505 00 $tTiling finite figures consisting of regular polygons /$rJ. Akiyama, M. Kano, and M.-J. Ruiz --$tEigenvalues, geometric expanders and sorting in rounds /$rN. Alon --$tLong path enumeration algorithms for timing verification on large digital systems /$rT. Asano and S. Sato --$tOn upsets in bipartite tournaments /$rK.S. Bagga --$tSome results on binary matrices obtained via bipartite tournaments /$rK.S. Bagga and L.W. Beineke --$tPartitioning the nodes of a graph /$rE.R. Barnes --$tA graph theoretical characterization of minimal deadlocks in petri nets /$rJ.-C. Bermond and G. Memmi --$tOn graceful directed graphs that are computational models of some algebraic systems /$rG.S. Bloom and D.F. Hsu --$tThe cut frequency vector /$rF.T. Boesch --$tDiameter vulnerability in networks /$rJ. Bond and C. Peyrat --$tGeneralized colorings of outerplanar and planar graphs /$rI. Broere and C.M. Mynhardt --
505 00 $tThe Ramsey number for the pair complete bipartite graph-graph of limited degree /$rS.A. Burr, P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp --$tEmbedding graphs in books: a layout problem with applications to VLSI design /$rF.R.K. Chung, F.T. Leighton, and A.L. Rosenberg --$tHamilton cycles and quotients of bipartite graphs /$rI.J. Dejter --$tProblems and results on chromatic numbers in finite and infinite graphs /$rP. Erdös --$tSupraconvergence and functions that sum to zero on cycles /$rV. Faber and A.B. White --$tEdge-disjoint Hamiltonian cycles /$rR.J. Faudree, C.C. Rousseau and R.H. Schelp --$tStudies related to the Ramsey number r(K₅-e) /$rR.J. raudree, C.D. Rousseau and R.H. Schelp --$tThe structral complexity of flowgraphs /$rN.E. Fenton --$tN-domination in graphs /$rJ.F. Fink and M.S. Jacobson --$tOn n-domination, n-dependence and forbidden subgraphs /$rJ.F. Fink and M.S. Jacobson --$tDigraphs with walks of equal length between vertices /
505 00 $rM.A. Fiol, I. Algegre, J.L.A. Yebra and J. Fábrega --$tApplication of numbered graphs in the design of multi-stage telecommand codes /$rS. Gansean and M.O. Ahmad --$tThe cochromatic number of graphs in a switching sequence /$rJ. Gimbel --$tA recursive algorithm for Hamiltonian cycles in the (1,j, n)-Cayley graph of the alternating group /$rR.J. Gould and R.L. Roth --$tFurther results on a generalization of edge-coloring /$rS.L. Hakimi --$tThe directed Shannon switching game and the one-way game /$rY.O. Hamidoune and M. Las Vergnas --$tGraph theoretic approaches to finite mathematical structures /$rF. Harary --$tDrawings of graphs and multiple crossings /$rH. Harborth --$tDomination in trees: models and algorithms /$rS. Hedetniemi, S. Hedetniemi and R. Laskar --$tConnected planar graphs with three or more orbits /$rJ.P. Hutchingson and L.B. Krompart --$tRelating metrics, lines and variables defined on graphs to problems in medicinal chemistry /$rM. Johnson --
505 00 $t[a, b]-factorizations of nearly bipartite graphs /$rM. Kano --$tThe complexity of pebbling for two classes of graphs /$rM.M. Klawe.
505 00 $tCompatible matchings in bipartite graphs /$rC.P. Kruskal and D.B. West --$tA linear time algorithm for finding an optimal dominating subforest of a tree /$rE.L. Lawler and P.J. Slater --$tToward a measure of vulnerability II. The ratio of disruption /$rM.J. Lipman and R.E. Pippert --$tCubic graphs and the four-color theorem /$rF. Loupekine and J.J. Watkins --$tAn effective approach to some practical capacitated tree problems /$rV.V. Malyshko --$tConcurrent flow and concurrent connectivity in graphs /$rD.W. Matula --$tA linear algorithm for topological bandwidth in degree three trees /$rZ. Miller --$tGeneralized colorings of graphs /$tC.M. Mynhardt and I. Broere --$tAn upper bound on the chromatic index of multigraphs /$rT. Nishizeki and K. Kashiwagi --$tBandwidths and profiles of trees /$rA.M. Odlyzko and H.S. Wilf --$t2-super-universal graphs /$rJ. Pach and L. Surányi --$tAn efficient algorithm for embedding graphs in the projective plane /$rB. Peruničić and Z. Durić --$tToward a measure of vulnerability I. The edge-connectivity vector /$rR.E. Pippert and M.J. Lipman --$tSome results on automorphisms of ordered relational systems and the theory of scale type in measurement /$rF.S. Roberts and Z. Rosenbaum --$tCounting strongly connected finite automata /$rR.W. Robinson --$tSome extensions of Ore's theorem /$rE. Schmeichel and D. Hayes --$tPacking a tree of order p with a (p, p) graph /$rS. Schuster --$tHow many rinds can a finite sequence of pairs have? /$rA.J. Schwenk --$tIterative algorithms for calculating network reliability /$rD.R. Shier --$tShortest path algorithms /$rR.E. Tarjan --$tThe binding number of lexicographic products of graphs /$rJ. Wang, S. Tian and J. Liu --$tSpanning trees in program flowgraphs /$rR.W. Whitty --$tAnalysis situs /$rR.J. Wilson --$tOn graphs which are metric spaces of negative type /$rP.M. Winkler.
650 0 $aGraph theory$vCongresses.
650 0 $aAlgorithms$vCongresses.
650 0 $aGraph theory$xData processing$vCongresses.
650 0 $aComputer algorithms$vCongresses.
655 7 $aConference proceedings.$2fast
655 7 $aKalamazoo (Mich., 1984)$2swd
700 1 $aAlavi, Y.
711 2 $aInternational Conference on the Theory and Applications of Graphs$n(5th :$d1984 :$cWestern Michigan University)
988 $a20020608
906 $0DLC