Discrete Geometry, Combinatorics and Graph Theory

- Infinite Series of Generalized Gosper Space Filling Curves

- Contractible Edges in a k-Connected Graph

- An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs

- On the Choice Numbers of Some Complete Multipartite Graphs

- On Convex Quadrangulations of Point Sets on the Plane

- Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs

- Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order

- A Neighborhood Condition for Graphs to Have [a, b]-Factors III

- General Balanced Subdivision of Two Sets of Points in the Plane

- Coverage Problem of Wireless Sensor Networks

- Some Topics on Edge-Coloring

- Hamiltonicity of Complements of Total Graphs

- Isolated Toughness and Existence of f-Factors

- A Note on the Integrity of Middle Graphs

- Indecomposable Coverings

- The Decycling Number of Cubic Planar Graphs

- Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs

- Rotational Steiner Ratio Problem Under Uniform Orientation Metrics

- Two Classes of Simple MCD Graphs

- Core Stability of Flow Games

- The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs

- Three Classes of Bipartite Integral Graphs

- Reconfirmation of Two Results on Disjoint Empty Convex Polygons

- The Binding Number of a Digraph

- The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph

- Fractional Vertex Arboricity of Graphs

- Fitting Triangles into Rectangles

- Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs

- On the Upper Chromatic Numbers of Mixed Interval Hypertrees

- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs