Excluding four-edge paths and their complements
نویسندگان
چکیده
We prove that a graph G contains no induced four-edge path and no induced complement of a four-edge path if and only if G is obtained from five-cycles and split graphs by repeatedly applying the following operations: substitution, split graph unification, and split graph unification in the complement (“split graph unification” is a new class-preserving operation that is introduced in this paper).
منابع مشابه
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m, 4)
In this paper, we investigate a problem on embedding paths into recursive circulant G(2, 4) with faulty elements (vertices and/or edges) and show that each pair of vertices in recursive circulant G(2, 4), m ≥ 3, are joined by a fault-free path of every length from m + 1 to |V (G(2, 4)\F )| − 1 inclusive for any fault set F with |F | ≤ m− 3. The bound m−3 on the number of acceptable faulty eleme...
متن کاملExcluding paths and antipaths
The Erdős-Hajnal conjecture states that for every graph H, there exists a constant δ(H) > 0, such that if a graph G has no induced subgraph isomorphic to H, then G contains a clique or a stable set of size at least |V (G)|. This conjecture is still open. We consider a variant of the conjecture, where instead of excluding H as an induced subgraph, both H and H are excluded. We prove this modifie...
متن کاملSequences of regressions and their dependences
In this paper, we study sequences of regressions in joint or single responses given a set of context variables, where a dependence structure of interest is captured by a regression graph. These graphs have nodes representing random variables and three types of edge. Their set of missing edges defines the independence structure of the graph provided two properties are used that are not common to...
متن کاملOn the Wiener Index of Some Edge Deleted Graphs
The sum of distances between all the pairs of vertices in a connected graph is known as the {it Wiener index} of the graph. In this paper, we obtain the Wiener index of edge complements of stars, complete subgraphs and cycles in $K_n$.
متن کاملDegree-associated reconstruction parameters of complete multipartite graphs and their complements
A vertex-deleted subgraph of a graphG is a card. A dacard consists of a card and the degree of the missing vertex. The degree-associated reconstruction number of a graph G, denoted drn(G), is the minimum number of dacards that suffice to reconstruct G. The adversary degree-associated reconstruction number adrn(G) is the least k such that every set of k dacards determines G. The analogous parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1302.0405 شماره
صفحات -
تاریخ انتشار 2013