Combinatorial Mathematics IX. Proceedings, Brisbane, Australia, 1981. (Lecture Notes in Mathematics, Vol. 952, edited by A. Dold and B. Eckmann) - pocketboek

EAN (ISBN-13): 9783540116011
ISBN (ISBN-10): 354011601X
Gebonden uitgave
pocket book
Verschijningsjaar: 1982
Uitgever: Springer Berlin
456 Bladzijden
Gewicht: 0,684 kg
Taal: eng/Englisch

Boek bevindt zich in het datenbestand sinds 2008-05-02T15:18:37+02:00 (Amsterdam)
Detailpagina laatst gewijzigd op 2024-01-31T14:23:16+01:00 (Amsterdam)
ISBN/EAN: 354011601X

ISBN - alternatieve schrijfwijzen:
3-540-11601-X, 978-3-540-11601-1
alternatieve schrijfwijzen en verwante zoekwoorden:
Auteur van het boek: neumann, oates, billington, anne penfold street, williams, dold
Titel van het boek: held, proceedings the australian conference combinatorial mathematics, august, lecture notes mathematics, brisbane queensland

---

Gegevens van de uitgever

Auteur: E. J. Billington; S. Oates-Williams; A. P. Street
Titel: Lecture Notes in Mathematics; Combinatorial Mathematics IX - Proceedings of the Ninth Australian Conference on Combinatorial Mathematics Held at the University of Queensland, Brisbane, Australia, August 24-28, 1981
Uitgeverij: Springer; Springer Berlin
446 Bladzijden
Verschijningsjaar: 1982-09-01
Berlin; Heidelberg; DE
Taal: Engels
48,10 € (DE)
49,45 € (AT)
64,63 CHF (CH)
Available
XIV, 446 p.

BC; Hardcover, Softcover / Mathematik/Sonstiges; Diskrete Mathematik; Verstehen; Hypergraph; Mathematics; Partition; algorithms; block design; graphs; combinatorics; Discrete Mathematics; EA

Star gazing in affine planes.- Orbits, enumeration and colouring.- Classifying distance-transitive graphs.- Some new methods in reconstruction theory.- On the uses of contracted codes.- When are symmetric graphs characterised by their local properties?.- Old and new results on perfect coverings.- The graph of hypergraphic realisations of denumerable multisets of degrees.- Construction of some irreducible designs.- Partitions and the sequence counting problem in economic lot scheduling.- Matroid bases, opposite families and some related algorithms.- An efficient heuristic for identifying a maximum weight planar subgraph.- Constructing certain cubic graphs.- Some decompositions of generalised Catalan numbers.- A corollary to Perfect's theorem.- Factoring binary matrices: A weaver's approach.- A class of natural bijections between catalan families.- A feasibility study of a search for ovals in a projective plane of order 10.- An interesting decomposition of k4n,4n into planar subgraphs.- Characterizations of different line graphs of graphs.- Some even composite graphs with stability index greater than one.- Fault-free rectangles tiled with rectangular polyominoes.- Some families of partially balanced incomplete block designs.- Directed coverings and packings of pairs and quadruples.- Sequential binary arrays II: Further results on the square grid.- A difference set construction for inversive planes.- On configurations of bear subplanes of the projective plane over a finite field of square order.