手段
发表于 2025-3-30 10:26:01
http://reply.papertrans.cn/23/2299/229889/229889_51.png
辩论
发表于 2025-3-30 14:00:17
http://reply.papertrans.cn/23/2299/229889/229889_52.png
Sedative
发表于 2025-3-30 19:51:10
http://reply.papertrans.cn/23/2299/229889/229889_53.png
因无茶而冷淡
发表于 2025-3-30 22:09:13
http://reply.papertrans.cn/23/2299/229889/229889_54.png
Moderate
发表于 2025-3-31 04:11:12
Bounds on Quasi-Completeness,A graph . = (.,.) is .-quasi-complete (. ∈ ) if every vertex in . is connected to at least ..(|.| − 1) other vertices. In this paper, we establish some relationships between the girth and the quasi-completeness of a graph. We also derive an upper bound . for the largest order .-quasi-complete subgraph in a graph of minimum degree ..
Exposure
发表于 2025-3-31 09:03:13
Maximum Order of a Planar Oclique Is 15,An oclique is an oriented graph where every pair of distinct non-adjacent vertices are connected by a directed path of length 2. Klostermeyer and MacGillivray conjectured that the maximum order of a planar oclique is 15. In this article we settle that conjecture.
GUILE
发表于 2025-3-31 09:48:30
http://reply.papertrans.cn/23/2299/229889/229889_57.png
HPA533
发表于 2025-3-31 16:57:35
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229889.jpg
admission
发表于 2025-3-31 18:07:01
http://reply.papertrans.cn/23/2299/229889/229889_59.png
误传
发表于 2025-4-1 00:04:00
http://reply.papertrans.cn/23/2299/229889/229889_60.png