Holes and a chordal cut in a graph

Details Holes and a chordal cut in a graph Holes and a chordal cut in a graph

2011-03-22

arxiv.org/abs/1103.4341v1

Mathematics

Combinatorics

12 pages, 1 figure

Scientific paper

A set $X$ of vertices of a graph $G$ is called a {\em clique cut} of $G$ if the subgraph of $G$ induced by $X$ is a complete graph and the number of connected components of $G-X$ is greater than that of $G$. A clique cut $X$ of $G$ is called a {\em chordal cut} of $G$ if there exists a union $U$ of connected components of $G-X$ such that $G[U \cup X]$ is a chordal graph. In this paper, we consider the following problem: Given a graph $G$, does the graph have a chordal cut? We show that $K_{2,2,2}$-free hole-edge-disjoint graphs have chordal cuts if they satisfy a certain condition.

Affiliated with

Also associated with

No associations

Rating

Holes and a chordal cut in a graph 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 Holes and a chordal cut in a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Holes and a chordal cut in a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49586