Resultado de búsqueda
A claw-free graph is a graph in which no induced subgraph is a claw; i.e., any subset of four vertices has other than only three edges connecting them in this pattern. Equivalently, a claw-free graph is a graph in which the neighborhood of any vertex is the complement of a triangle-free graph.
25 de abr. de 2024 · The line graph of any graph is claw-free, as is the complement of any triangle-free graph. Classes of graphs that are claw-free include 1. antiprism graphs, 2. barbell graphs, 3. bishop graphs (and their connected components), 4. cocktail party graphs K_(n×2), 5. complete graphs, 6. cycle graphs, 7. de Bruijn...
claw-free ∩ locally connected; claw-free ∩ upper domination perfect; claw-free ∩ well covered; middle; quasi-line
A claw is a trigraph with four vertices a0,a1,a2,a3, such that {a1,a2,a3} is stable and a0 is complete to {a1,a2,a3}. If X ⊆ V(G) and G|X is a claw, we often loosely say that X is a claw; and if no induced subtrigraph of G is a claw, we say that G is claw-free. It is easy to check that if H is
10 de feb. de 1997 · A claw-free graph, called the comparability graph (or also the interval graph -- cf. [48] and Theorems 6.6-6.8), is obtained by associating a vertex to each of these intervals and putting edges between vertices if and only if the corresponding intervals have nonempty intersection. (~) Middle graphs.
- Ralph Faudree, Evelyne Flandrin, Zdeněk Ryjáček
- 1997
A graph is claw-free if no induced subgraph is isomorphic to the complete bipartite graph K1;3. In this series of papers we give a structural description of all claw-free graphs.
1 de sept. de 2008 · A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In this series of papers we give a structural description of all claw-free graphs. In this paper, we achieve a major part of that goal; we prove that every claw-free graph either belongs to one of a few basic classes, or admits a decomposition in a useful way.
