hardheaded
发表于 2025-3-23 13:25:21
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs,exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for . in proper interval graphs.
飞镖
发表于 2025-3-23 14:17:59
http://reply.papertrans.cn/23/2299/229881/229881_12.png
Cosmopolitan
发表于 2025-3-23 20:03:56
http://reply.papertrans.cn/23/2299/229881/229881_13.png
高射炮
发表于 2025-3-24 02:01:04
http://reply.papertrans.cn/23/2299/229881/229881_14.png
终止
发表于 2025-3-24 05:29:48
http://reply.papertrans.cn/23/2299/229881/229881_15.png
Substitution
发表于 2025-3-24 08:34:20
http://reply.papertrans.cn/23/2299/229881/229881_16.png
overbearing
发表于 2025-3-24 10:47:15
http://reply.papertrans.cn/23/2299/229881/229881_17.png
FADE
发表于 2025-3-24 16:06:28
The Hull Number in the Convexity of Induced Paths of Order 3,ning .. If the .-convex hull of . is .(.), then . is a .. The minimum size of a .-hull set is the .. In this paper, we show that the problem of deciding whether the .-hull number of a chordal graph is at most . is .-complete and present a linear-time algorithm to determine this parameter and provide
沙草纸
发表于 2025-3-24 21:24:07
Supermagic Graphs with Many Odd Degrees, is equal to the same number ., called the ...Recently, Kovář et al. affirmatively answered a question by Madaras about existence of supermagic graphs with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic
心神不宁
发表于 2025-3-24 23:12:00
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229881.jpg