Arbitrary orientations of Hamilton cycles in digraphs Amelia Taylor (University of Birmingham) Let n be sufficiently large and suppose that G is a digraph on n vertices where every vertex has in- and outdegree at least n

Source URL: web.mat.bham.ac.uk

The Price of Connectivity for Vertex Cover Eglantine Camby, Jean Cardinal, Samuel Fiorini, and Oliver Schaudt † Universit´e Libre de Bruxelles (ULB), D´epartement de Math´ematique, CP 216, B-1050 Brussels, Belgium {

Source URL: www.zaik.uni-koeln.de

Noname manuscript No. (will be inserted by the editor) Convex Partitions with 2-Edge Connected Dual Graphs Marwan Al-Jubeh · Michael Hoffmann · Mashhood Ishaque · Diane L. Souvaine ·

Source URL: www.eecs.tufts.edu

• Graph theory
• Mathematics
• Geometry
• Planar graphs
• Convex geometry
• Elementary geometry
• Graph operations
• Dual graph
• Vertex
• Convex polygon
• Edge
• Convex set

Hausdorff Core of a One Reflex Vertex Polygon Robert Fraser and Patrick Nicholson University of Waterloo August 10th, 2010

Source URL: www.cs.umanitoba.ca

The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs Eglantine Camby1 , Jean Cardinal2 , Samuel Fiorini1 , and Oliver Schaudt3? 1 2

Source URL: homepages.ulb.ac.be

GPU Conversion of Quad Meshes to Smooth Surfaces Ashish Myles∗ Young In Yeo† J¨org Peters‡ University of Florida

Source URL: www.cise.ufl.edu

• 3D computer graphics
• Multivariate interpolation
• Image processing
• Computer graphics
• CatmullClark subdivision surface
• Bzier surface
• Shader
• Tessellation
• B-spline
• ARB assembly language
• Vertex
• Subdivision surface

3-choosability of planar graphs with (≤ 4)-cycles far apart Zdeněk Dvořák∗ Abstract A graph is k-choosable if it can be colored whenever every vertex

Source URL: iti.mff.cuni.cz

d-representability of simplicial complexes of fixed dimension ∗ Martin Tancer† Abstract Let K be a simplicial complex with vertex set V = {v1 , . . . , vn }. The

Source URL: iti.mff.cuni.cz

Kernelization Through Tidying---A Case Study Based on s-Plex Cluster Vertex Deletion

Source URL: theinf1.informatik.uni-jena.de

AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS MARIA AXENOVICH AND RYAN MARTIN Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of

Source URL: www.math.kit.edu