Results 91 to 100 of about 1,442,532 (348)
Advanced Engineering Materials, EarlyView.Temporal power modulation increases weld depth in high‐power laser beam welding of dissimilar round bars by nearly 20% compared to same average continuously welded welding power. The mechanism of action also applies to sheet welding and depends on the inertia of keyhole depth for the modulated laser beam power.
Jan Grajczak +7 more
wiley +1 more source
On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords
Discussiones Mathematicae Graph Theory, 2019 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ∆ ≥ 8 is edge-colorable with ∆ colors if each of its 5-cycles contains ...
Sun Lin, Wu Jianliang
doaj +1 more source
Longer Cycles in Essentially 4-Connected Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 A planar 3-connected graph G is called essentially 4-connected if, for every 3-separator S, at least one of the two components of G − S is an isolated vertex.
Fabrici Igor +3 more
doaj +1 more source
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
, 2016 An $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two sets $F$ and $F_d$ such that the graph induced by $F$ is a forest and the one induced by $F_d$ is a forest with maximum degree at most $d$.
Dross, François +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.A hybrid system for de‐icing made of gradient polymer coatings, deposited on aluminum coupled with an electromechanical system, is demonstrated as an effective and durable strategy for reducing drastically ice adhesion. The system is capable of detaching ice blocks over the coating in less than 1 s, regardless of the ice type and covered area ...
Gabriel Hernández Rodríguez +8 more
wiley +1 more source
On the Synthesis of Planar Graphs with Given Properties
Кібернетика та комп'ютерні технологіїThe problem of studying the structural properties of planar subgraphs G\v, where v is an arbitrary vertex of a graph G of undirected genus, is considered, using cell chains that connect limit cycles with points of a given set M of the graph G\v.
Volodymyr Petrenjuk, Dmytro Petreniuk
doaj +1 more source
Planar Graph Isomorphism is in Log-Space
2009 24th Annual IEEE Conference on Computational Complexity, 2009 Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extant lower and upper bounds for planar graphs as well.
Samir Datta +4 more
semanticscholar +1 more source
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3
, 2017 We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables.
Kiefer, Sandra +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.Hydrostatic bearings excel in high‐precision applications, but their performance hinges on a continuous external supply. This study evaluates various material combinations for sliding surfaces to mitigate damage during supply failures or misalignment and to discover the most effective materials identified for enhancing the reliability and efficiency of
Michal Michalec +6 more
wiley +1 more source
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source