Resultado de búsqueda
18 de may. de 2024 · This paper studies the maximum 3-star packing problem in claw-free cubic graphs. We establish the intractability of this problem and design a Greedy-Based-ALG which can find a 3-star packing of a connected claw-free cubic graph on n vertices that covers at least \(\frac{3n-8}{4}\) vertices.
- Loop Zero Forcing and Grundy Domination in Planar ... - Springer
As it turns out, we only ever considered zero forcing sets...
- Loop Zero Forcing and Grundy Domination in Planar ... - Springer
Hace 4 días · Invoke an algorithm for finding a maximum weight independent set in a claw-free graph. First such an algorithm is due to Minty [ 14 ], while the best known one with the complexity \(O(n^3)\) may be found in [ 4 ].
Hace 10 horas · graph, any two edges belong to a common conformal cycle. There are several other terms used in the literature for conformal cycles : well-fitted cycles in McCuaig[14]; nice cycles in Lova´sz [11]; and central cycles in Robertson, Seymour and Thomas [18]. Zhang, Wang, Yuan, Ng and Cheng [21] provided a characterization of claw-free cycle-
16 de may. de 2024 · Matthews and Sumner showed that there is equality if the graph is claw-free, where a claw is an induced copy of K 1, 3 subscript 𝐾 1 3 K_{1,3} italic_K start_POSTSUBSCRIPT 1 , 3 end_POSTSUBSCRIPT. We say that such a graph is supertough if its toughness is half its degree.
1 de may. de 2024 · In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families.
16 de may. de 2024 · A conjecture of Berge predicts that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. If the graph in question has no 3-edge-colouring, then at least four perfect matchings are necessary.
