Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k

100%

Matsumura H.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 1

191-196

A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k. We denote by σk(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k ≥ 3 and s ≥ 0 be integers, and suppose G is a connected graph and σk(G) ≥ |V (G)|+s−1. Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree less than k. The degree condition is sharp.

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Partitions of a graph into cycles containing a specified linear forest

63%

Matsubara R., Matsumura H.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 1

97-107

In this note, we consider the partition of a graph into cycles containing a specified linear forest. Minimum degree and degree sum conditions are given, which are best possible.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

2 Matsumura H.

1 Matsubara R.

1 2015

1 2008

Wyniki wyszukiwania

On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k

Partitions of a graph into cycles containing a specified linear forest