The Existence Of P≥3-Factor Covered Graphs

• Autorzy: Sizhong Zhou , Jiancheng Wu , Tao Zhang
• Języki publikacji: EN

Abstrakty

EN

A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.

Słowa kluczowe

EN

P≥3-factor; P≥3-factor covered graph; toughness; isolated toughness; regular graph.

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 1055-1065

Daty

wydano

2017-11-27

otrzymano

2015-10-27

poprawiono

2016-08-27

zaakceptowano

2016-08-27

online

2017-09-02

Twórcy

autor

Sizhong Zhou

• 212003, P.R.

autor

Jiancheng Wu

• 212003, P.R.

autor

Tao Zhang

• 212003, P.R.

Identyfikatory

DOI

10.7151/dmgt.1974