Results 201 to 210 of about 5,178 (231)
Using swin UNETR deep model for automated detection of alveolar bone fenestration/dehiscence in CBCT. [PDF]
Front Bioeng BiotechnolXu A, Huang H, Zhang B, Dong S, Che X.
europepmc +1 more source
Error Resilient Space Partitioning. [PDF]
Discrete Comput GeomDunkelman O +6 more
europepmc +1 more source
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 HealthBakitian F.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The strong edge-coloring for graphs with small edge weight
Discrete Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gexin Yu, Xiangqian Zhou, Lily Chen
exaly +5 more sources
Strong Edge-Coloring of Pseudo-Halin Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangwen Li, Li Xiangwen
exaly +2 more sources
On (s, t)-relaxed strong edge-coloring of graphs
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wensong Lin, Lin Wensong
exaly +3 more sources
Strong edge-coloring for planar graphs with large girth
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gexin Yu, Xiangqian Zhou, Lily Chen
exaly +5 more sources
On strong edge-coloring of graphs with maximum degree 5
Discrete Applied MathematicsA strong edge-coloring of a simple finite graph \(G = (V(G),E(G))\) is a proper edge coloring of \(G\) such that any two edges of distance at most \(2\) receive distinct colors. This is the same as saying that any two vertices in the corresponding line graph \(L(G)\) of \(G\) of distance of at most \(2\) must receive distinct colors.
Huiqing Liu, Jian Lu
exaly +2 more sources