Incompetent
发表于 2025-3-23 12:33:15
http://reply.papertrans.cn/16/1532/153167/153167_11.png
Spinous-Process
发表于 2025-3-23 14:21:54
http://reply.papertrans.cn/16/1532/153167/153167_12.png
意外的成功
发表于 2025-3-23 20:18:22
http://reply.papertrans.cn/16/1532/153167/153167_13.png
Munificent
发表于 2025-3-23 23:21:58
Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs[.] is .-indicated colorable for all .. Also, we show that for any graph . and for some classes of graphs . with ., .[.] is .-indicated colorable if and only if . is .-indicated colorable. As a consequence of this result we show that if .Chordal graphs, Cographs, .-free graphs, Complete multipartite
GET
发表于 2025-3-24 02:28:35
Smallest ,-Critical Graphs of Odd-Girth aphs are the classic .-(colour)-critical graphs. This work is a first step towards extending questions of extremal nature from .-critical graphs to .-critical graphs. Besides complete graphs, the next classic case is odd cycles. Thus, given integers . we ask: what is the smallest order . of a .-crit
hermitage
发表于 2025-3-24 07:20:01
http://reply.papertrans.cn/16/1532/153167/153167_16.png
Myocarditis
发表于 2025-3-24 11:36:21
http://reply.papertrans.cn/16/1532/153167/153167_17.png
使混合
发表于 2025-3-24 15:55:49
http://reply.papertrans.cn/16/1532/153167/153167_18.png
淡紫色花
发表于 2025-3-24 20:41:24
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classessolve . with sublogarithmic approximation factor (in terms of the number of vertices) even on graphs with diameter 2. On the positive side, we give an .-approximation algorithm for . on general graphs of order .. We also give a 3-approximation algorithm for . on solid grid graphs which are planar.
oxidant
发表于 2025-3-25 00:14:23
http://reply.papertrans.cn/16/1532/153167/153167_20.png