Yap h k (28 risultati)

Condizione: 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.

Paperback. Condizione: Fine.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

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

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Hardcover. Condizione: 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.].…

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

N.A. Condizione: New. ISBN:9798886131499,Territorial restriction maybe printed on the book. This is an Int'l edition, ISBN and cover may differ from US edition, Contents same as US edition.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Taschenbuch. Condizione: 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.…

Octavo, illus light card covers with french flaps, red, black & white lettering to spine, xviii + 230pp, VG (light creasing to spine & covers, light foxing to page edges & eps, gift inscrition in ink to ffep, occasional annotations in red ink- unobtrusive).

Condizione: New.

Condizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…

Condizione: 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. Condizione: Very Good. Used Very Good -Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

Hardcover. Condizione: Brand New. 274 pages. 8.75x6.25x0.75 inches. In Stock.

N.A. Condizione: New. ISBN:9789811297540.

Condizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.…

PF. Condizione: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condizione: 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.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 st.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 352 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextThis volume contains selected papers presented at the Spring School and International Conference on Combinatorics. Topics discussed include: Enumeration, Design, Graphs, Hypergraphs and Combinatorial Optimization, etc. Coverin. …

Buch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This volume contains selected papers presented at the Spring School and International Conference on Combinatorics. Topics discussed include: Enumeration, Design, Graphs, Hypergraphs and Combinatorial Optimization, etc. Covering a broad range, this book should appeal to a wide spectrum of researchers in combinatorics and graph theory. …

Buch. Condizione: Neu. COMBINATORICS & GRAPH THEORY | H K Lloyd M Wang P Yap T H Ku | Buch | Englisch | 1993 | World Scientific | EAN 9789810215040 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.