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â€¦Â (More)

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

2016

2016

- Zuosong Liang, Erfang Shan, Liying Kang
- Graphs and Combinatorics
- 2016

A clique is defined as a complete subgraph maximal under inclusion and having at least two vertices. A k-clique-coloring of aâ€¦Â (More)

Is this relevant?

2010

2010

- Maria Chudnovsky, Paul D. Seymour
- J. Comb. Theory, Ser. B
- 2010

In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic numberâ€¦Â (More)

Is this relevant?

2009

2009

In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic numberâ€¦Â (More)

Is this relevant?

2008

2008

- Maria Chudnovsky, Paul D. Seymour
- J. Comb. Theory, Ser. B
- 2008

A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. In earlier papers of this series we proved thatâ€¦Â (More)

Is this relevant?

2007

2007

- Mingchu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai
- Discrete Mathematics
- 2007

A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 â‰¤ l â‰¤ 4) C1â€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Maria Chudnovsky, Paul D. Seymour
- Surveys in Combinatorics
- 2005

A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. At first sight, there seem to be a great variety ofâ€¦Â (More)

Is this relevant?

2004

2004

- HongJian Lai, Lianying Miao, Yehong Shao, Liangxia Wan
- 2004

A graph G is triangularly connected if for every pair of edges e1, e2 âˆˆ E(G), G has a sequence of 3-cycles C1, C2, Â· Â· Â· , Clâ€¦Â (More)

Is this relevant?

2002

2002

- Ronald J. Gould, Florian Pfender
- Discrete Mathematics
- 2002

In this paper, we present several conditions for K1;3-free graphs, which guarantee the graph is subpancyclic. In particular, weâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Zdenek RyjÃ¡cek
- J. Comb. Theory, Ser. B
- 1997

If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a lineâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- George J. Minty
- J. Comb. Theory, Ser. B
- 1980

A graph is claw-free if: whenever three (distinct) vertices are joined to a single vertex, those three vertices are aâ€¦Â (More)

Is this relevant?