The Ryjáček closure and a forbidden subgraph | Zendy

Akira Saito | Zendy; Liming Xiong | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Ryjáček closure and a forbidden subgraph

Author(s) -

Akira Saito,

Liming Xiong

Publication year - 2016

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.1876

Subject(s) - mathematics , combinatorics , closure (psychology) , induced subgraph isomorphism problem , induced subgraph , graph , vertex (graph theory) , political science , voltage graph , line graph , law

The Ryjáček closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to this hope, and show that the claw is the only forbidden subgraph that produces non-trivial results on Hamiltonicity by the use of the Ryjáček closure

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