peptic-ulcer
发表于 2025-3-23 12:25:46
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle,Given a triangle-free planar graph . and a cycle . of length 9 in ., we characterize all situations where a 3-coloring of . does not extend to a proper 3-coloring of .. This extends previous results for the length of . up to 8.
QUAIL
发表于 2025-3-23 15:33:53
Kratochvíl Jan,Mirka Miller,Dalibor FroncekIncludes supplementary material:
connoisseur
发表于 2025-3-23 20:57:58
http://reply.papertrans.cn/23/2299/229888/229888_13.png
分开
发表于 2025-3-24 01:02:15
J. A. J. Metz,A. M. de Roos,F. van den Boschgraphs and .-trees. Little is known, however, about the parameterized complexity of the problem. When parameterized by the vertex cover number of the input graphs, the problem was recently shown to be fixed-parameter tractable. Capitalizing on this result, we show that the problem does not have a po
加入
发表于 2025-3-24 06:01:40
https://doi.org/10.1007/978-3-642-74001-5le, undirected graph . and a coloring of the vertices, remove a collection of edges from the graph such that each connected component is . (i.e., it does not contain two identically colored vertices) and the number of edges in the transitive closure of the graph is maximized..The problem is known to
Mangle
发表于 2025-3-24 07:39:13
http://reply.papertrans.cn/23/2299/229888/229888_16.png
无弹性
发表于 2025-3-24 11:47:21
Setting the Scene for the Sizewell B PWR,elements from the Galois lattice of a bipartite graph is tree-like if and only if the graph is a Bipartite Distance Hereditary graph. We show that the lattice can be realized as the containment relation among directed paths in an arborescence. Moreover, a compact encoding of Bipartite Distance Hered
起皱纹
发表于 2025-3-24 18:13:44
https://doi.org/10.1007/978-3-658-28243-1iently: one asymptotically fast; the other very fast on average and in practice. Because the latter approach avoids the computation of global data structures, such as the suffix array and the longest common prefix array, it yields algorithms much faster in practice than existing methods. We show how
palliative-care
发表于 2025-3-24 18:59:28
Kastell Mola, Naxos, Melia und Mongiuffi,nary vectors of same length indicating the borders. We characterize precisely which of these vectors are valid border correlations, and establish a one-to-one correspondence between the set of valid border correlations and the set of valid period correlations of a given length, the latter being tern
腐败
发表于 2025-3-25 00:05:22
René König Schriften. Ausgabe letzter Handrd characters or holes, was recently considered and shown to be in .. Polynomial-time algorithms that construct representations were described using graph theoretical approaches. As more holes are allowed, representations shrink, and if representation is given, the set can be reconstructed. We furth