For a graph G, we denote by σ 2 ( G ) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, σ 2 ( G ) = + ∞ .

Feb 19, 2018 · A pair ( H 1 , H 2 ) is called a partition of G if H 1 and H 2 are two disjoint induced subgraphs of G such that V ( G ) = V ( H 1 ) ∪ V ( H 2 ) ...

Mar 11, 2015 · For a graph G, we denote by \sigma_{2}(G) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, \sigma_{2}(G) = +\infty.

Abstract. For a graph G, we denote by σ2(G) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, σ2(G)=+∞.

For a graph $G$, we denote by $\sigma_{2}(G)$ the minimum degree sum of two non-adjacent vertices if $G$ is non-complete; otherwise, $\sigma_{2}(G) ...

Mar 30, 2014 · Prove that if G is a graph with maximum vertex degree equal 3, then G can be divided into 2 edge-disjoint subgraphs C and F, where C is sum of ...

For a graph G, we denote by σ2(G) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, σ2(G)=+∞. In this paper, we give the ...

Semantic Scholar extracted view of "Vertex-disjoint subgraphs with high degree sums" by S. Chiba et al.

In this paper, we consider a degree sum condition sufficient to imply the existence of \(k\) vertex-disjoint chorded cycles in a graph \(G\).

Sep 8, 2012 · Prove that if G is a graph with maximum vertex degree equal 3, then G can be divided into 2 edge-disjoint subgraphs C and F.