硬化
发表于 2025-3-23 11:48:07
http://reply.papertrans.cn/39/3882/388158/388158_11.png
SYN
发表于 2025-3-23 17:37:22
Graphs and Combinatorial Optimization: from Theory to Applications
flutter
发表于 2025-3-23 18:36:36
The Chromatic Polynomial of a Digraph,ber of such colorings with . colors can be done by counting so-called Neumann-Lara-coflows (NL-coflows), which build a polynomial in .. We will present a representation of this polynomial using totally cyclic subdigraphs, which form a graded poset .. Furthermore we will decompose our NL-coflow polyn
BOOST
发表于 2025-3-24 01:02:50
On List ,-Coloring Convex Bipartite Graphs,with colors in {1, 2, …, .}. The problem is known to be NP-hard even for . = 3 within the class of 3-regular planar bipartite graphs and for . = 4 within the class of chordal bipartite graphs. In 2015 Huang, Johnson and Paulusma asked for the complexity of . 3. in the class of chordal bipartite grap
syncope
发表于 2025-3-24 03:09:26
Total Chromatic Sum for Trees, provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
间谍活动
发表于 2025-3-24 08:32:31
http://reply.papertrans.cn/39/3882/388158/388158_16.png
Myosin
发表于 2025-3-24 12:32:11
http://reply.papertrans.cn/39/3882/388158/388158_17.png
百灵鸟
发表于 2025-3-24 15:27:33
http://reply.papertrans.cn/39/3882/388158/388158_18.png
千篇一律
发表于 2025-3-24 22:49:57
http://reply.papertrans.cn/39/3882/388158/388158_19.png
极小
发表于 2025-3-24 23:49:39
http://reply.papertrans.cn/39/3882/388158/388158_20.png