Results 71 to 80 of about 757,662 (296)

On the Biplanarity of Blowups

open access: yesJournal of Graph Algorithms and Applications
The 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

Drawing Outer 1-planar Graphs with Few Slopes

open access: yesJournal of Graph Algorithms and Applications, 2015
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees.
Emilio Di Giacomo   +2 more
doaj   +1 more source

Crossing Numbers of Beyond-Planar Graphs Revisited

open access: yesJournal 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

Flexural Behavior of 3D‐Printed Porous Bouligand‐Structured Polymers: Influence of Pitch Angle and Porosity

open access: yesAdvanced Engineering Materials, EarlyView.
This study examines how helicoidal architectures with different porosities respond to bending. Adjusting layer angle and spacing in 3D‐printed polymers reveals clear tradeoffs between stiffness, strength, and energy absorption. Experiments and simulations highlight designs that distribute stress effectively, offering pathways for optimizing lightweight
Praveenkumar Subhash Patil   +2 more
wiley   +1 more source

On the size of planarly connected crossing graphs

open access: yesJournal 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

Investigating the Effect of Inclination Angle and the Influence of Scan Parameters on the Appearance and Thermal and Mechanical Properties of Filigree Tension Rods of LPBF‐Manufactured NiTi Shape‐Memory Alloys

open access: yesAdvanced Engineering Materials, EarlyView.
This article investigates the dependence of the properties on the manufacturing orientation in the form of the inclination angle to the build plate of LPBF‐fabricated NiTi rods with a diameter of 150–220 µm. Metallographic, chemical, thermal, and mechanical characterization show behavior under identical manufacturing conditions that ranges from ...
Sandra Herzig   +2 more
wiley   +1 more source

The Role of Ultra‐Thin Passive Films and Organic Adsorbates on Aluminum Chips for a Friction‐Induced Solid‐State Recycling Process

open access: yesAdvanced 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

Planar cycle-extendable graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi   +3 more
doaj   +1 more source

The d-precoloring problem for k-degenerate graphs [PDF]

open access: yes, 2006
In this paper we deal with the d-PRECOLORING EXTENSION (d-PREXT) problem in various classes of graphs. The d-PREXTproblem is the special case of PRECOLORING EXTENSION problem where, for a fixed constant d, input instances are restricted to contain at ...
Chlebikova, Janka   +3 more
core   +1 more source

Microstructural, Mechanical, and Textural Evolution of Dissimilar Combination of Laser‐Welded Maraging Steel and 4340 Steel

open access: yesAdvanced Engineering Materials, EarlyView.
The present work reports the microstructural, mechanical, and texture evolution of a dissimilar combination laser‐welded maraging steel with 4340 steel. This is important for aerospace applications. The demand for dissimilar welding is growing rapidly with the requirement of efficient and durable joints.
Bharat Behl   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy