Pairs of forbidden class of subgraphs concerning K1,3and P6to have a cycle containing specified vertices | Zendy

Takeshi Sugiyama | Zendy; Masao Tsugaki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Pairs of forbidden class of subgraphs concerning K_1,3and P₆to have a cycle containing specified vertices

Author(s) -

Takeshi Sugiyama,

Masao Tsugaki

Publication year - 2009

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1470

Subject(s) - mathematics , combinatorics , class (philosophy) , discrete mathematics , computer science , artificial intelligence

In [3], Faudree and Gould showed that if a 2-connected graph contains no K1,3 and P6 as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices. We define the families of graphs which are extension of the forbidden pair K1,3 and P6, and prove that the forbidden families implies the existence of cycles passing through specified vertices.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research