Results 71 to 80 of about 29,700 (214)
Quantum approaches to graph colouring
AbstractIn this paper, we investigate quantum algorithms for graph colouring problems, in particular for 2- and 3-colouring of graphs. Our main goal is to establish a set of quantum representations and operations suitable for the problem at hand. We propose unitary- as well as measurement-based quantum computations, also taking inspiration from answer ...
openaire +5 more sources
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
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
List colourings of planar graphs
AbstractA graph G = G(V, E) is called L-list colourable if there is a vertex colouring of G in which the colour assigned to a vertex v is chosen from a list L(v) associated with this vertex. We say G is k-choosable if all lists L(v) have the cardinality k and G is L-list colourable for all possible assignments of such lists.
openaire +3 more sources
Developing process parameters for the laser‐based Powder Bed Fusion of metals can be a tedious task. Based on melt pool depth, the process parameters are transferable to different laser scan speeds. For this, understanding the melt pool scaling behavior is essential, particularly for materials with high thermal diffusivity, as a change in scaling ...
Markus Döring+2 more
wiley +1 more source
Defective and Clustered Graph Colouring
Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$.
Wood, David R.
core
Colourings of Graphs and Words
Extremal graph theory is concerned with the extreme values of a graph parameter over various classes of graphs. Randomised constructions have played a major role in extremal combinatorics. This phenomenon acted as a catalyst for the development of probabilistic combinatorics and the theory of random graphs as independent research areas.
openaire +3 more sources
In this manuscript, the processability of X2CrNiMo17‐12‐2 powder coated with silicon carbide, silicon, and silicon nitride nanoparticles is investigated. The amount of nanoparticles varies from 0.25 to 1 vol%. By coating the powder feedstock material with nanoparticles, an enlargement of the process window and an increase in the build rate are achieved.
Nick Hantke+5 more
wiley +1 more source
Neuwirth manifolds and colourings of graphs [PDF]
The paper uses the fact that PL manifolds may be studied through graphs with coloured edges. The representation is given by taking the l-skeleton of the cellular subdivision dual to a suitable triangulation (minimal with respect to the vertices) of a manifold.
openaire +2 more sources
This study examines the mechanical properties of triply periodic minimal surfaces (TPMS)‐based lattices, analyzing 36 architectures in elastic and plastic regimes. It evaluates the applicability of beam‐based scaling laws to TPMS lattices. Rigidity arises from the alignment of members with the load direction and solid regions preventing rotation.
Lucía Doyle+2 more
wiley +1 more source