Claw-free graph

In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2011

A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and if the…

2010

A set S of vertices in a graph G=(V,E) is a total restrained dominating set (TRDS) of G if every vertex of G is adjacent to a…

2008

A closure concept for undirected graphs based on the structure of the second neighborhood of a vertex is introduced. It is shown…

2007

The 3-COLORABILITY problem is NP-complete in the class of claw-free graphs. In this paper we study the computational complexity…

2006

Claw lameness can be associated to biomechanical factors caused by unbalanced pressure distribution under the hooves when cows…

2005

A graph G is N2‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent…

2005

Let G be a graph and let V0 = {ν∈ V(G): dG(ν) = 6}. We show in this paper that: (i) if G is a 6‐connected line graph and if |V0…

1994

1992

Abstract : A graph G is 2-extendable if it has at least six vertices and every pair of independent edges extends to (i.e., is a…

1967