On the existence of a specified cycle in digraphs with constraints on degrees | Zendy

Benhocine Abdelhamid | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

On the existence of a specified cycle in digraphs with constraints on degrees

Author(s) -

Benhocine Abdelhamid

Publication year - 1984

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.3190080111

Subject(s) - digraph , hamiltonian path , mathematics , combinatorics , hamiltonian (control theory) , directed graph , strongly connected component , path (computing) , graph , discrete mathematics , hamiltonian path problem , computer science , mathematical optimization , programming language

We prove that Woodall's and Ghouila‐Houri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by both an edge and a Hamiltonian path.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research