Computational Geometry and Graph Theory

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.- Chvatal-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.