轻快走过
发表于 2025-3-25 04:12:29
Brambles, Prisms and Grids,e their tree-width bounded by an exponential function of .. Using brambles and their well-studied relation to tree-width, we show that they have in fact tree-width .(..). As a consequence, we obtain new bounds on the tree-width of graphs having no small grid as a minor.
–DOX
发表于 2025-3-25 10:24:51
http://reply.papertrans.cn/39/3880/387957/387957_22.png
intimate
发表于 2025-3-25 14:37:33
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs,er, the total domination number, the paired domination number, the double domination number and the independence number. We summarize the old and new results in a table and give for each bound examples of extremal families.
Vulvodynia
发表于 2025-3-25 18:55:48
Excessive Factorizations of Regular Graphs,egular graphs. We introduce two graph parameters related to excessive factorizations and show that their computation is NP-hard. We pose a number of questions regarding these parameters. We show that the size of an excessive factorization of a regular graph can exceed the degree of the graph by an a
Anthrp
发表于 2025-3-25 22:00:50
http://reply.papertrans.cn/39/3880/387957/387957_25.png
北极熊
发表于 2025-3-26 03:09:28
On Edge-maps whose Inverse Preserves Flows or Tensions, . if the pre-image of every cycle of . is a cycle of .. A fascinating conjecture of Jaeger asserts that every bridgeless graph has a cycle-continuous mapping to the Petersen graph. Jaeger showed that if this conjecture is true, then so is the 5-cycle-double-cover conjecture and the Fulkerson conjec
无脊椎
发表于 2025-3-26 07:53:21
http://reply.papertrans.cn/39/3880/387957/387957_27.png
hurricane
发表于 2025-3-26 08:28:37
Even Pairs in Bull-reducible Graphs,rtices such that every chordless path joining them has even length. We prove that for every bull-reducible Berge graph . with at least two vertices, either . or its complementary graph . has an even pair.
Corral
发表于 2025-3-26 14:07:45
Kernels in Orientations of Pretransitive Orientable Graphs,h that for every . ∈ . (.) − . there exists an arc from . to .. A digraph . is called . (resp. left-pretransitive) when (.) ∈ .(.) and (.) ∈ .(.) implies (.) ∈ .(.) or (.) ∈ .(.) (resp. (.) ∈ .(.) and (.) ∈ .(.) implies (.) ∈ .(.) or (.) ∈ .(.)). These concepts were introduced by P. Duchet in 1980.
Fsh238
发表于 2025-3-26 19:08:37
Nonrepetitive Graph Coloring,r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and resul