Results 211 to 220 of about 60,707 (240)
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths. [PDF]
Theory Comput SystBentert M, Fomin FV, Golovach PA.
europepmc +1 more source
Error Resilient Space Partitioning. [PDF]
Discrete Comput GeomDunkelman O +6 more
europepmc +1 more source
Agraphia due to Conversion Disorder (Functional Neurological Symptom Disorder) in an 8-year-old boy: a case report. [PDF]
Front PsychiatryTran NMH, Le TTA, Nguyen VQH.
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.
Lily Chen, Gexin Yu, Xiangqian Zhou
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, Jian-Bo Lv
exaly +2 more sources
Strong edge-coloring for planar graphs with large girth
Discrete Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lily Chen, Kecai Deng, Gexin Yu
exaly +5 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
exaly +3 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.
Jian Lu, Huiqing Liu
exaly +2 more sources
Strong edge coloring of circle graphs
European Journal of Combinatorics, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michal Debski +1 more
openaire +2 more sources