Graph classes characterized both by forbidden subgraphs and degree sequences
نویسندگان
چکیده
Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. We give a complete characterization of the degree-sequence-forcing sets F when F has cardinality at most two. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 131–148, 2008
منابع مشابه
Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques for the structural analysis of such graph classes, which applied to the case of two forbidden subgraphs give the following results: A dichotomy i...
متن کاملOn Fractional Realizations of Graph Degree Sequences
We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope; we characterize degree sequences for which each polytope vertex corresponds to a simple graph realization. These include the degree sequences of threshold and pseudo-split graphs, and we characterize their re...
متن کاملVertex 3-colorability of Claw-free Graphs
The 3-colorability problem is NP-complete in the class of clawfree graphs and it remains hard in many of its subclasses obtained by forbidding additional subgraphs. (Line graphs and claw-free graphs of vertex degree at most four provide two examples.) In this paper we study the computational complexity of the 3-colorability problem in subclasses of claw-free graphs defined by finitely many forb...
متن کاملClique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs
If a graph has no induced subgraph isomorphic to any graph in a finite family {H1, . . . ,Hp}, it is said to be (H1, . . . ,Hp)-free. The class of H-free graphs has bounded clique-width if and only if H is an induced subgraph of the 4-vertex path P4. We study the (un)boundedness of the clique-width of graph classes defined by two forbidden induced subgraphs H1 and H2. Prior to our study it was ...
متن کاملBlack-and-White Threshold Graphs
Let k be a natural number. We introduce k-threshold graphs. We show that there exists anO(n) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of forbidden induced subgraphs. For the case k = 2 we characterize the partitioned 2threshold graphs by forbidden induced subgraphs. We introduce restricted, and spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 57 شماره
صفحات -
تاریخ انتشار 2008