Yap K M (39 results)

Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: As New. Unread book in perfect condition.

Condition: New.

Paperback or Softback. Condition: New. Graph Theory Singapore 1983: Proceedings of the First Southeast Asian Graph Theory Colloquium, Held in Singapore, May 10-28, 1983. Book.

Paperback. Condition: Fine.

Paperback. Condition: New.

Condition: New.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Very Fine. Octavo in white illus jacket; 97 pages: illustrations; 19 cm. Translation of Xin lai di lao da. Contents: Chang, T.Y. and Chang, C.Y. The young skipper -- Chiu, H.P. Old sentry -- Yao, K.M. Old Hsin's day of retirement -- Chao, T. Red navigation route. Short stories, Chinese -- Translations into English. Manners and customs. Short stories, Chinese. Fiction. Translations. Translations into English. Fiction. Very fine with owner chop, in very fine jacket. An impressively crisp copy. in fine dust-jacket First edition (stated) ; [First English language ed.]. …

Condition: New.

Condition: New.

Softcover. Condition: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-03563 3540133682 Sprache: Englisch Gewicht in Gramm: 1050.

Paperback. Condition: New. 1st ed. 2016. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

PF. Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. pp. 593.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - On 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.…

Taschenbuch. Condition: Neu. Mathematical Aspects of Computer and Information Sciences | 6th International Conference, MACIS 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers | Ilias S. Kotsireas (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xxiii | Englisch | 2016 | Springer | EAN 9783319328584 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Paperback. Condition: Brand New. revised edition. 652 pages. 9.25x6.10x1.47 inches. In Stock.

Condition: Sehr gut. Zustand: Sehr gut | Seiten: 352 | Sprache: Englisch | Produktart: Bücher | On 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.…

Paperback. Condition: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: As New. Unread book in perfect condition.

Condition: New. Presents biological sequence analysis using an interdisciplinary approach that integrates biological, mathematical and computational concepts. This book focuses on high performance computational approaches that are used to perform computationally intensive biological sequence analysis tasks like pairwise sequence comparison. Num Pages: 212 pages, biography. BIC Classification: PSF; UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1996. 1996th Edition. hardcover. . . . .…

Condition: New. Presents biological sequence analysis using an interdisciplinary approach that integrates biological, mathematical and computational concepts. This book focuses on high performance computational approaches that are used to perform computationally intensive biological sequence analysis tasks like pairwise sequence comparison. Num Pages: 212 pages, biography. BIC Classification: PSF; UYFP. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1996. 1996th Edition. hardcover. . . . . Books ship from the US and Ireland.…

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -On 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. 352 pp. Englisch.…