Results 111 to 120 of about 713,494 (298)
On the Total Number of Bends for Planar Octilinear Drawings
Journal of Graph Algorithms and Applications, 2017 An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at $45^\circ$ and $-45^\circ$ line-segments.
Michael Bekos +2 more
doaj +1 more source
On the reconstruction of planar graphs
Journal of Combinatorial Theory, Series B, 2007 AbstractWe show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs.
Mark Bilinski +2 more
openaire +1 more source
Advanced Functional Materials, EarlyView.This study advances SafeWax, a bio‐inspired, fatty‐acids‐based superhydrophobic coating, by identifying an agriculturally compliant solvent and revealing how solvent‐controlled Fatty acid crystallization governs the coating's microscopic structure and performance.
Niv Ben‐Arie +13 more
wiley +1 more source
Good triangulations yield good tours [PDF]
, 2008 Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N, Letchford, A N
core +3 more sources
Computing in Geometry and TopologyWe study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., convex drawings. We consider two families of graph classes with convex drawings: outer $k$-planar graphs, where each edge is crossed by at ...
Steven Chaplick +4 more
doaj +1 more source
Recursive generation of simple planar 5-regular graphs and pentangulations
Journal of Graph Algorithms and Applications, 2011 We describe how the 5-regular simple planar graphs can all be obtained from an elementary family of starting graphs by repeatedly applying a few local expansion operations. The proof uses an amalgam of theory and computation.
Mahdieh Hasheminezhad +2 more
doaj +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
Advanced Functional Materials, EarlyView.A gas‐fed, zero‐gap, PEM CO2 electrolyzer is realized by incorporating PDDA+ ions onto the carbonaceous Co/N‐C electrocatalyst, with gaseous H2 and CO2 fed into the anode and cathode, respectively. Operating without an aqueous electrolyte, the system sustains a peak FECO of 65.1% at 100 mA cm−2. ABSTRACT Electrochemical carbon dioxide reduction (ECO2R)
Yuen Leong Chow +6 more
wiley +1 more source
On the Maximum Independent Set Problem in Subclasses of Planar Graphs
Journal of Graph Algorithms and Applications, 2010 The maximum independent set problem is known to be NP-hard in the class of planar graphs. In the present paper, we study its complexity in hereditary subclasses of planar graphs.
Vadim Lozin, Martin Milanič
doaj +1 more source
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elaine M. Eschen +2 more
openaire +1 more source