sorbitol
发表于 2025-3-27 01:01:39
Recent results on graphical enumeration,We present four of our counting results which are to appear soon in various journals. These comprise: (1) the number of caterpillars, (2) the number of self-complementary configurations, (3) the number of achiral trees, and (4) the probability of an endpoint in a large random tree. We conclude with a brief mention of four miscellaneous results.
STALL
发表于 2025-3-27 04:30:54
http://reply.papertrans.cn/39/3882/388159/388159_32.png
jabber
发表于 2025-3-27 07:40:07
Chromatically equivalent graphs,Let G,H be graphs, and P(G,λ), P(H,λ) be the chromatic polynomials of G,H respectively. Then ., (written P .H), if P(G,λ) = P(H,λ)..In this paper, we first state some open questions relating to chromatic equivalence of graphs, and then give non-trivial examples of chromatically equivalent graphs and their chromatic polynomials.
通便
发表于 2025-3-27 13:20:48
http://reply.papertrans.cn/39/3882/388159/388159_34.png
Forsake
发表于 2025-3-27 13:36:47
http://reply.papertrans.cn/39/3882/388159/388159_35.png
吸气
发表于 2025-3-27 18:10:35
On the ramsey number of the five-spoked wheel,Let r(W.) be the smallest n such that the five-spoked wheel W. √ G or else W. √ . for every graph G with n vertices. Recently, Erdös asked whether whether r(W.) ≥ 18; we prove that 17 ≤ r(W.) ≤ 20. In so doing, we establish that r(C., W.) = 13. We conjecture that r(W.) = 20.
Canvas
发表于 2025-3-27 23:10:29
Graphs and Combinatorics978-3-540-37809-9Series ISSN 0075-8434 Series E-ISSN 1617-9692
按时间顺序
发表于 2025-3-28 04:37:36
http://reply.papertrans.cn/39/3882/388159/388159_38.png
febrile
发表于 2025-3-28 07:12:07
http://reply.papertrans.cn/39/3882/388159/388159_39.png
ILEUM
发表于 2025-3-28 14:25:32
http://reply.papertrans.cn/39/3882/388159/388159_40.png