Results 91 to 100 of about 1,282,765 (250)
On planar hypohamiltonian graphs
Journal of Graph Theory, 2010 We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for every integer n≥N there exists a planar hypohamiltonian ...
Wiener, Gabor, Araya, Makoto
openaire +3 more sources
Computational Geometry, 2009 AbstractWe review results concerning edge flips in planar graphs concentrating mainly on various aspects of the following problem: Given two different planar graphs of the same size, how many edge flips are necessary and sufficient to transform one graph into another?
Ferran Hurtado, Prosenjit Bose
openaire +2 more sources
Electronic Journal of Graph Theory and Applications, 2016 Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\em routes} rather than {\em edges} as primitives.
David J. Aldous
doaj +1 more source
Various heuristic algorithms to minimise the two-page crossing numbers of graphs
Open Computer Science, 2015 We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various one-
He Hongmei +3 more
doaj +1 more source
, 2016 We prove two results on the classification of trivial Legendrian embeddings $g: G \rightarrow (S^3, _{std})$ of planar graphs. First, the oriented Legendrian ribbon $R_g$ and rotation invariant $\text{rot}_g$ are a complete set of invariants. Second, if $G$ is 3-connected or contains $K_4$ as a minor, then the unique trivial embedding of $G$ is ...
Lambert-Cole, Peter, O'Donnol, Danielle
openaire +2 more sources
Vector Bond Graph Method of Kineto- static Analysis for Hybrid Driving Five Linkage Mechanism
Jixie chuandong, 2016 For improving the reliability and efficiency of the kineto- static analysis for hybrid driving linkage mechanism,the corresponding vector bond graph method is proposed.
Wang Zhongshuang, Wang Xifeng
doaj
Jixie chuandong, 2013 Through the application of Assur bar groups method and graph theory,the link classification and link composition are finished to get the most basic kinematic chain’s structure of the planar 3-DOF mechanism with full revolute pairs which has three ...
吴凡, 李瑞琴
doaj
Cubic identity graphs and planar graphs derived from trees [PDF]
, 1970 A. T. Balaban +4 more
openalex +1 more source