Results 91 to 100 of about 892,813 (298)
Algorithm and Experiments in Testing Planar Graphs for Isomorphism
Journal of Graph Algorithms and Applications, 2004 We give an algorithm for isomorphism testing of planar graphs suitable for practical implementation. The algorithm is based on the decomposition of a graph into biconnected components and further into SPQR-trees.
Jacek Kukluk +2 more
doaj +1 more source
Posets and planar graphs [PDF]
Journal of Graph Theory, 2005 AbstractUsually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [t − 1 ↕ t], thought to be between t − 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most [2↕3].
Stefan Felsner, William T. Trotter
openaire +1 more source
Design of a Multistable Finger Prosthesis with Programmable Metamaterials
Advanced Engineering Materials, EarlyView.This research article shows the development of a multistable programmble metamaterial for the use as a finger prosthesis. The material was designed on different hierarchical levels where the influence of geometrical parameters and combination of mechanical elements was explored.
Franziska Wenz +5 more
wiley +1 more source
Augmenting the Connectivity of Planar and Geometric Graphs
Journal of Graph Algorithms and Applications, 2012 In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property.
Ignaz Rutter, Alexander Wolff
doaj +1 more source
Planarization of Clustered Graphs [PDF]
, 2002 We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Di Battista G. +2 more
openaire +3 more sources
Fabrication Routes for Ionic Conducting Fiber Strain Sensors
Advanced Engineering Materials, EarlyView.Ionic conducting fiber strain sensors (ICFSs) offer compliant, textile‐integrable sensing. Thus far, the commercialization of ICFSs has been constrained by fiber fabrication routes. This review provides a fabrication‐centric analysis of ICFSs correlating processing strategies with material properties and scalability.
Leo John Kershaw +3 more
wiley +1 more source
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
Discrete Dynamics in Nature and Society, 2020 A total k-coloring of a graph is an assignment of k colors to its vertices and edges such that no two adjacent or incident elements receive the same color.
Enqiang Zhu, Yongsheng Rao
doaj +1 more source
On the depth of a planar graph
Discrete Mathematics, 1976 AbstractIn this paper, we have defined the concept of the depth of a planar graph. We show that, if G is a simple finite planar graph with p vertices and q edges and q > 3(p − 1) − p/2s−1, then the depth of G is at least equal to s.
Vinay G. Kane, Sanat K. Basu
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Despite benefits to storage stability and handleability of aluminum scrap, octadecyl phosphonic acid (ODPA) SAMs reduce the tensile strength of wires produced using friction‐induced recycling. Etching and methyl diphosphonic acid (MDPA) coatings, however, have little effect.
Timothy D. Goller +3 more
wiley +1 more source
1-Visibility Representations of 1-Planar Graphs
Journal of Graph Algorithms and Applications, 2014 A 1-visibility representation of a graph displays each vertex as a horizontal vertex-segment, called a bar, and each edge as a vertical edge-segment between the segments of the vertices, such that each edge-segment crosses at most one vertex-segment and ...
Franz Brandenburg
doaj +1 more source