Resultado de búsqueda
19 de may. de 2000 · In particular, if F = K 1,3 , then the graph is claw-free, while if F = K 4 − e , then the graph is diamond-free. An excellent survey of claw-free graphs has been written by Flandrin et al. [7] .
The structure of claw-free graphs Maria Chudnovsky and Paul Seymour Abstract A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. At rst sight, there seem to be a great variety of types of claw-free graphs. For instance, there are line graphs, the graph of the icosahedron, complements of triangle-free graphs, and the Schl a
N2 - For a graph H and an integer K ≥ 2, let σk(H) denote the minimum degree sum of k independent Vertices of H. We prove that if a connected claw-free graph G satisfies σk+1 (G) ≥ |G| -k, then G has a spanning tree with at most k leaves. We also show that the bound |G| -k is sharp and discuss the maximum degree of the required spanning ...
1 de ene. de 1998 · 70. Lemma 2.3.LetD be a minimal connected dominating set of a claw-free graph. G, and let X be the vertices of D in two or more cliques of the subgraph induced. by D. Then, for any x e X, D- {x ...
无爪图的1-因子问题. 此文源自 于青林和刘桂真的 图的因子和匹配可扩性问题 。. 并做适当的补充。. 如果一个图不包含 K_ {1,3} 作为导出子图就称其为无爪的 (claw free). 无爪图是研究图参数一个非常常见的条件。. 一个重要的原因是因为无爪条件下，很多图论问题 ...
4-edge-connected graph has a no-where-zero 3-flow. Towards the hamiltonian line graph problem, we proved that every 3-connected N. 2-locally connected claw-free graph is hamil-tonian, which was conjectured by Ryjacek in 1990; that every 4-connected line graph of an almost claw free graph is hamiltonian connected, and that every triangularly ...
10 de abr. de 2018 · A claw is the graph isomorphic to K1,3 K 1, 3, that is, a star graph with three edges, three leaves, and one central vertex. (see below) A graph is claw-free if it does not contain a claw as an induced subgraph. The line graph of G is the intersection graph of the edges of G, that represents the adjacencies between edges of G.
