Graphs without even holes or diamonds

Details Graphs without even holes or diamonds Graphs without even holes or diamonds

2011-04-20

arxiv.org/abs/1104.3920v1

Mathematics

Combinatorics

Scientific paper

An even hole is an induced chordless cycle of even length at least four. A
diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without
even holes and without diamonds can be decomposed via clique-separators into
graphs that have uniformly bounded cliquewidth.

Affiliated with

Also associated with

No associations

Rating

Graphs without even holes or diamonds does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphs without even holes or diamonds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs without even holes or diamonds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431783