2011•Graphs and CombinatoricsRequires access

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs

Arthur H. Busch, Michael S. Jacobson, Tim R. Morris, Michael J. Plantholt, Shailesh K. Tipnis

Open publisher page 6 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Hamiltonian path, Mathematics, Combinatorics, Directed graph, Hamiltonian (control theory), Strongly connected component, Graph, Hamiltonian path problem

Back to paper search Browse research topics Original source

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs — Research Paper | ScholarLens