Precursor
发表于 2025-3-23 13:30:39
On Minimum Connecting Transition Sets in Graphs,cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.
一瞥
发表于 2025-3-23 14:26:44
Recognizing Hyperelliptic Graphs in Polynomial Time,aph algorithms and number theory. We consider so-called . (multigraphs of gonality 2) and provide a safe and complete set of reduction rules for such multigraphs, showing that we can recognize hyperelliptic graphs in time ., where . is the number of vertices and . the number of edges of the multigra
艰苦地移动
发表于 2025-3-23 20:51:14
http://reply.papertrans.cn/39/3881/388020/388020_13.png
刺穿
发表于 2025-3-24 01:27:36
,Optimality Program in Segment and String Graphs,is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in . by Fox and Pach , we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which p
monochromatic
发表于 2025-3-24 05:15:46
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded,s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromati
发展
发表于 2025-3-24 08:34:40
http://reply.papertrans.cn/39/3881/388020/388020_16.png
VICT
发表于 2025-3-24 14:05:10
http://reply.papertrans.cn/39/3881/388020/388020_17.png
Calculus
发表于 2025-3-24 15:06:30
http://reply.papertrans.cn/39/3881/388020/388020_18.png
牲畜栏
发表于 2025-3-24 22:57:36
http://reply.papertrans.cn/39/3881/388020/388020_19.png
cogent
发表于 2025-3-25 00:43:23
http://reply.papertrans.cn/39/3881/388020/388020_20.png