Non-separating 2-factors of an even-regular graph
نویسندگان
چکیده
منابع مشابه
Non-separating 2-factors of an even-regular graph
For a 2-factor F of a connected graph G, we consider G − F , which is the graph obtained from G by removing all the edges of F . If G − F is connected, F is said to be a non-separating 2-factor. In this paper we study a sufficient condition for a 2r -regular connected graph G to have such a 2-factor. As a result, we show that a 2r -regular connected graph G has a non-separating 2-factor wheneve...
متن کاملEven Cycles and Even 2-Factors in the Line Graph of a Simple Graph
Let G be a connected graph with an even number of edges. We show that if the subgraph of G induced by the vertices of odd degree has a perfect matching, then the line graph of G has a 2-factor whose connected components are cycles of even length (an even 2-factor). For a cubic graph G, we also give a necessary and sufficient condition so that the corresponding line graph L(G) has an even cycle ...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملConnected Even Factors in the Square of Essentially 2-Edge-connected Graph
An essentially k-edge connected graph G is a connected graph such that deleting less than k edges from G cannot result in two nontrivial components. In this paper we prove that if an essentially 2-edge-connected graph G satisfies that for any pair of leaves at distance 4 in G there exists another leaf of G that has distance 2 to one of them, then the square G2 has a connected even factor with m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.10.021