Factor-criticality and matching extension in DCT-graphs
نویسندگان
چکیده
The class of DCT-graphs is a common generalization of the classes of almost claw-free and quasi claw-free graphs. We prove that every even (2p + 1)-connected DCT-graph G is p-extendable, i.e., every set of p independent edges of G is contained in a perfect matching of G. This result is obtained as a corollary of a stronger result concerning factor-criticality of DCT-graphs.
منابع مشابه
Matching properties in connected domination critical graphs
A dominating set of vertices S of a graph G is connected if the subgraph G[S] is connected. Let c(G) denote the size of any smallest connected dominating set in G. A graph G is k-connected-critical if c(G)= k, but if any edge e ∈ E(Ḡ) is added to G, then c(G+ e) k − 1. This is a variation on the earlier concept of criticality of edge addition with respect to ordinary domination where a graph G ...
متن کاملMycielskians and matchings
It is shown in this note that some matching-related properties of graphs, such as their factor-criticality, regularizability and the existence of perfect 2-matchings, are preserved when iterating Mycielski’s construction.
متن کاملSe p 20 06 Generalization of matching extensions in graphs ( II ) ∗
Proposed as a general framework, Liu and Yu [4] (Discrete Math. 231 (2001) 311-320) introduced (n, k, d)-graphs to unify the concepts of deficiency of matchings, n-factor-criticality and k-extendability. Let G be a graph and let n, k and d be non-negative integers such that n + 2k + d ≤ |V (G)| − 2 and |V (G)| − n − d is even. If when deleting any n vertices from G, the remaining subgraph H of ...
متن کامل4-Factor-Criticality of Vertex-Transitive Graphs
A graph of order n is p-factor-critical, where p is an integer of the same parity as n, if the removal of any set of p vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are well-known factor-critical graphs and bicritical graphs, respectively. It is known that if a connected vertextransitive graph has odd order, then it is factor-critical...
متن کاملStar-Uniform Graphs
A star-factor of a graph G is a spanning subgraph of G such that each of its component is a star. Clearly, every graph without isolated vertices has a star factor. A graph G is called star-uniform if all star-factors of G have the same number of components. To characterize star-uniform graphs was an open problem posed by Hartnell and Rall, which is motivated by the minimum cost spanning tree an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 17 شماره
صفحات -
تاریخ انتشار 1997