Results 71 to 80 of about 713,494 (298)
Degeneracies of Triangulated Graphs
Theory and Applications of GraphsA graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate.
Allan Bickle
doaj +1 more source
Crossing Numbers of Beyond-Planar Graphs Revisited
Journal of Graph Algorithms and Applications, 2022 Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden (edge) crossing configurations. A natural criterion for the quality of a drawing is the number of edge crossings.
Nathan van Beusekom +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Journal of Graph Algorithms and ApplicationsThe 2-blowup of a graph is obtained by replacing each vertex with two non-adjacent copies; a graph is biplanar if it is the union of two planar graphs. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar: iterated Kleetopes ...
David Eppstein
doaj +1 more source
On the size of planarly connected crossing graphs
Journal of Graph Algorithms and Applications, 2018 We prove that if an $n$-vertex graph $G$ can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then $G$ has $O(n)$ edges.
Eyal Ackerman +2 more
doaj +1 more source
Minimizing the oriented diameter of a planar graph [PDF]
, 2009 We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Noble, SD +3 more
core +1 more source
Acyclic 4-choosability of planar graphs without 4-cycles [PDF]
, 2020 summary:A proper vertex coloring of a graph $G$ is acyclic if there is no bicolored cycle in $G$. In other words, each cycle of $G$ must be colored with at least three colors.
Sun, Yingcai, Chen, Min
core +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 more
wiley +1 more source
New AI‐Assisted Approach for Expanding the Solution Space: Application to Lattice Structure Design
Advanced Engineering Materials, EarlyView.This work introduces an innovative framework for designing structured materials by ex panding the design space through reparameterization of qualitative variables into continuous structural descriptors. Combined with machine‐learning‐based prediction and multi‐objective optimization, the approach enables the discovery of novel lattice architectures ...
G. H. Gahimbare +5 more
wiley +1 more source
Intersection Graphs in Simultaneous Embedding with Fixed Edges
Journal of Graph Algorithms and Applications, 2009 We examine the problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a for (G1,G2).
Michael Jünger, Michael Schulz
doaj +1 more source