Results 221 to 230 of about 41,117 (251)

Influence of manufacturer, laboratory, clinical, and aging-related factors on the mechanical properties of multilayered zirconia: a systematic review of laboratory studies. [PDF]

BMC Oral Health
Bakitian F.
europepmc   +1 more source

Error Resilient Space Partitioning. [PDF]

Discrete Comput Geom
Dunkelman O, Geyzel Z, Keller C, Keller N, Ronen E, Shamir A, Tessler RJ.   +6 more
europepmc   +1 more source

Constructing Asymmetric Sn-Cu-C Interface via Defective Carbon Trapped Atomic Clusters for Efficient Neutral Nitrate Reduction. [PDF]

Adv Mater
Wu Q, Han Y, Wu L, Fan Y, Zhu F, Zhang D, Wang X, Tang S, Pang W, Jia Y, Du A, Yao X, Chen J.   +12 more
europepmc   +1 more source

The strong edge-coloring for graphs with small edge weight [PDF]

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gexin Yu, Xiangqian Zhou, Lily Chen
exaly   +6 more sources

Strong edge-coloring for planar graphs with large girth [PDF]

Discrete Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gexin Yu, Xiangqian Zhou, Lily Chen
exaly   +6 more sources

Recent progress on strong edge-coloring of graphs [PDF]

Discrete Mathematics, Algorithms and Applications, 2019
A strong edge-coloring of a graph [Formula: see text] is a partition of its edge set [Formula: see text] into induced matchings. In this paper, we gave a short survey on recent results about strong edge-coloring of a graph.
Kecai Deng, Gexin Yu, Xiangqian Zhou
openaire   +5 more sources

List Strong Edge-Colorings of Sparse Graphs [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deng, Kecai, Huang, Ningge, Zhang, Haiyang, Zhou, Xiangqian   +3 more
openaire   +3 more sources

Strong edge-coloring of $(3, Δ)$-bipartite graphs [PDF]

Discret. Math., 2014
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum degree $Δ$. For every such graph, we prove that a strong $4Δ$-edge-coloring can always be obtained.
Julien Bensmail, Aurélie Lagoutte, Petru Valicov   +2 more
openaire   +3 more sources