Koh k m (33 Ergebnisse)

Paperback. Zustand: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Ed. North-Holland, Amsterdam - 1986, in-8, broché, 118 pages Bon état, table des matières sur la photo - Pour les envois hors de France, la tafication «livre & brochure» pour les frais de port a disparue.Les frais de port annoncés correspondent à une moyenne. Ils seront calculés au plus juste en fonction du poids de votre article.…

Zustand: 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. Zustand: Brand New. 124 pages. 8.75x6.00x0.50 inches. In Stock.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: Used. pp. 220.

Zustand: Used. pp. 220.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

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

Zustand: New. KlappentextrnrnUnlike some other reproductions of classic texts (1) We have not used OCR(Optical Character Recognition), as this leads to bad quality books with introduced typos. (2) In books where there are images such as portraits, maps, sketc.

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

Hardcover. Zustand: Brand New. 124 pages. 9.00x6.00x0.75 inches. In Stock.

Zustand: new.

Softcover. Zustand: Very good. xxvii, 356 p. 23 cm. Paperback. A bit of soiling and sratches to covers.

Paperback. Zustand: New. This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of graphs and the zeros and inequalities of chromatic polynomials. The early material is well suited to a graduate level course while the latter parts will be an invaluable resource for postgraduate students and researchers in combinatorics and graph theory.…

Zustand: New.

Paperback. Zustand: Brand New. illustrated edition. 244 pages. 9.00x6.00x0.75 inches. In Stock.

Zustand: 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.…

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

Paperback. Zustand: Brand New. illustrated edition. 384 pages. 8.50x5.75x0.75 inches. In Stock.

Paperback. Zustand: Brand New. illustrated edition. 244 pages. 9.00x6.00x0.75 inches. In Stock.

Paperback. Zustand: New. This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of graphs and the zeros and inequalities of chromatic polynomials. The early material is well suited to a graduate level course while the latter parts will be an invaluable resource for postgraduate students and researchers in combinatorics and graph theory.…

Hardback. Zustand: New. Illustrated. This is the first book to comprehensively cover chromatic polynomials of graphs. It includes most of the known results and unsolved problems in the area of chromatic polynomials. Dividing the book into three main parts, the authors take readers from the rudiments of chromatic polynomials to more complex topics: the chromatic equivalence classes of graphs and the zeros and inequalities of chromatic polynomials. The early material is well suited to a graduate level course while the latter parts will be an invaluable resource for postgraduate students and researchers in combinatorics and graph theory.…