Hamiltonian problems in directed graphs with simple row patterns

DOI10.1016/j.tcs.2022.03.005OpenAlexW4220728390WikidataQ114129130 ScholiaQ114129130MaRDI QIDQ2143132

Irena Rusu

Publication date: 31 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.03.005

zbMATH Keywords

Hamiltonian problemsconsecutive ones propertycomplexity of algorithmslinear ordering of the vertices

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on Hamilton cycles in directed graphs
• Permutation reconstruction from differences
• A simplified NP-complete satisfiability problem
• On hamiltonicity of circulant digraphs of outdegree three
• Some simplified NP-complete graph problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• The Hamiltonian property of consecutive-\(d\) digraphs
• Hamiltonian cycles in circulant digraphs with two stripes
• The Hamiltonian property of linear functions
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
• Interval digraphs: An analogue of interval graphs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• Spectral Theory and Analysis

This page was built for publication: Hamiltonian problems in directed graphs with simple row patterns