Closure of K1 + 2K2-free graphs
نویسندگان
چکیده
منابع مشابه
Chromatic bounds for some classes of 2K2-free graphs
A hereditary class G of graphs is χ-bounded if there is a χ-binding function, say f such that χ(G) ≤ f(ω(G)), for every G ∈ G, where χ(G) (ω(G)) denote the chromatic (clique) number of G. It is known that for every 2K2-free graph G, χ(G) ≤ ( ω(G)+1 2 ) , and the class of (2K2, 3K1)-free graphs does not admit a linear χ-binding function. In this paper, we are interested in classes of 2K2-free gr...
متن کاملMaximum induced matchings in graphs
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
متن کاملThe maximum number of edges in 2K2-free graphs of bounded degree
We call a graph 2K2-free if it is connected and does not contain two independent edges as an induced subgraph. The assumption of connectedness in this definition only serves to eliminate isolated vertices. Wagon [6] proved that x(G) ~ w(G)[w(G) + 1]/2 if G is 2Krfree where x(G) and w(G) denote respectively the chromatic number and maximum clique size of G. Further properties of 2K2-free graphs ...
متن کاملColouring of ( P3 ∪ P2)-free graphs
The class of 2K2-free graphs and its various subclasses have been studied in a variety of contexts. In this paper, we are concerned with the colouring of (P3 ∪P2)-free graphs, a super class of 2K2-free graphs. We derive a O(ω3) upper bound for the chromatic number of (P3 ∪P2)-free graphs, and sharper bounds for (P3 ∪P2, diamond)-free graphs, where ω denotes the clique number. By applying simila...
متن کاملConstrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs
Strictly Chordality-k graphs (SCk) are graphs which are either cycle-free or every induced cycle is of length exactly k, k ≥ 3. Strictly chordality-3 and strictly chordality-4 graphs are well known chordal and chordal bipartite graphs, respectively. For k ≥ 5, the study has been recently initiated in [1] and various structural and algorithmic results are reported. In this paper, we show that ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2005