Autore	Arlinghaus William C. <1944->
Pubbl/distr/stampa	Providence, Rhode Island : , : American Mathematical Society, , 1985
Descrizione fisica	1 online resource (98 p.)
Disciplina	511/.5
Collana	Memoirs of the American Mathematical Society
Soggetto topico	Graph theory Abelian groups Automorphisms
Soggetto genere / forma	Electronic books.
ISBN	1-4704-0743-4
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	""APPENDIX B: VARIATIONS OF COMMUTATIVITY LEMMAS""""INDEX OF NOTATION""; ""REFERENCES""
Record Nr.	UNINA-9910480740303321

Edizione	[1st ed. 2008.]
Pubbl/distr/stampa	Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica	1 online resource (XII, 237 p.)
Disciplina	511/.5
Collana	Image Processing, Computer Vision, Pattern Recognition, and Graphics
Soggetto topico	Geometry - Data processing Graph theory - Data processing
ISBN	3-540-89550-7
Classificazione	DAT 537f MAT 052f MAT 055f SS 4800
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Dudeney Transformation of Normal Tiles -- Chromatic Numbers of Specified Isohedral Tilings -- Transforming Graphs with the Same Degree Sequence -- The Forest Number of (n,m)-Graphs -- Computing Simple Paths on Points in Simple Polygons -- Deflating the Pentagon -- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry -- Solvable Trees -- Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle -- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets -- Fast Skew Partition Recognition -- Some Results on Fractional Graph Theory -- Seven Types of Random Spherical Triangle in S n and Their Probabilities -- (3,2)-Track Layout of Bipartite Graph Subdivisions -- Bartholdi Zeta Functions of Branched Coverings of Digraphs -- On Super Edge-Magic Strength and Deficiency of Graphs -- The Number of Flips Required to Obtain Non-crossing Convex Cycles -- Divide and Conquer Method for k-Set Polygons -- Coloring Axis-Parallel Rectangles -- Domination in Cubic Graphs of Large Girth -- Chvátal–Erd?s Theorem: Old Theorem with New Aspects -- Computer-Aided Creation of Impossible Objects and Impossible Motions -- The Hamiltonian Number of Cubic Graphs -- SUDOKU Colorings of the Hexagonal Bipyramid Fractal.
Record Nr.	UNINA-9910483671203321

Edizione	[1st ed. 2001.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Descrizione fisica	1 online resource (XIV, 318 p.)
Disciplina	511/.5
Collana	Lecture Notes in Computer Science
Soggetto topico	Discrete mathematics Algorithms Computer science—Mathematics Computer graphics Combinatorics Information technology Business—Data processing Discrete Mathematics Algorithm Analysis and Problem Complexity Mathematics of Computing Computer Graphics IT in Business
ISBN	3-540-44969-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Graph Drawing and Its Applications -- Drawing Planar Graphs -- Drawing Trees, Series-Parallel Digraphs, and Lattices -- Drawing on Physical Analogies -- Layered Drawings of Digraphs -- Orthogonal Graph Drawing -- 3D Graph Drawing -- Drawing Clusters and Hierarchies -- Dynamic Graph Drawing -- Map Labeling with Application to Graph Drawing -- Software Packages.
Record Nr.	UNINA-9910145795403321

Autore	Appel Kenneth I. <1932-2013, >
Pubbl/distr/stampa	Providence, Rhode Island : , : American Mathematical Society, , [1989]
Descrizione fisica	1 online resource (760 p.)
Disciplina	511/.5
Collana	Contemporary mathematics
Soggetto topico	Four-color problem
Soggetto genere / forma	Electronic books.
ISBN	0-8218-7686-4 0-8218-5431-3
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	""Contents""; ""Acknowledgments""; ""Introduction""; ""1. History""; ""2. C- and D-Reducibility""; ""3. Unavoidable Sets and our Discharging Procedure""; ""4. Details of the Proof""; ""5. Our Checking Procedure""; ""Bibliography""; ""Part I: Discharging""; ""1. Introduction D-429""; ""2. The Discharging Procedure D-435""; ""3. The Set U of Reducible Configurations D-459""; ""4. Probabilistic Considerations D-478""; ""5. Possible Improvements D-486""; ""Bibliography D-489""; ""Part II: Reducibility""; ""1. Introduction R-491""; ""2. The Computer Programs R-492"" ""3. Immersion Reducibility R-493""""4. The Unavoidable Set U of Reducible Configurations R-503""; ""Appendix to Part II""; ""(a) Planar graphs and maps""; ""(b) Planar graphs and triangulations""; ""(c) Planar graphs with contractions""; ""(d) Kempe components and interchanges on a colored graph""; ""(e) Representative colorations on a labeled n-ring Rn""; ""(f) Fillings/contractions of Rn""; ""(g) Kempe components on a maximal filling/contraction of Rn""; ""(h) Kempe interchangeable sets on a maximal filling/contraction""; ""(i) Abstract Kempe chain dispositions on Rn"" ""(j) Open subsets of Đ?n""""(k) The Kempe related extension of a subset of Đ?n; reducibility""; ""(l) The outside filling/contraction of an immersion image""; ""(m) C-reducing a triangulation""; ""(n) The open subsets of Đ?4 and Đ?5; the critical open subsets of Đ?6""; ""(o) A. Bernhart's Bend Condition for R6-reducibility""; ""(p) The semi-critical open subsets of Đ?6 that satisfy the Bend Condition""; ""(q) R3-, R4-, R5-, and R6-reducing a triangulation""; ""(r) Extended immersion images and simple extensions""; ""(s) Configuration sets closed under simple extensions"" ""(t) Sufficient conditions for non-critical configurations""""(u) Conditions for non-critical reducers""; ""(v) The Z-reducible closure U* of the unavoidable set U""; ""(w) Locating reducible configurations or rings in triangulations""; ""(x) The main algorithm""; ""(y) An upper bound for the time demand, polynomial in N""; ""(z) Possible improvements""; ""Supplement to Part I""; ""Lemmas on T -dischargings, stated S-2""; ""proofs S-3""; ""Lemma (I) S-6""; ""Table l S-7""; ""Proof of Lemma (I), continued S-12""; ""Proof of Lemma (S+) S-14""; ""Proof of the qTS(V5)-Lemma Introduction S-15""
Altri titoli varianti	Every planar map is 4 colorable
Record Nr.	UNINA-9910480762403321