scientific article; zbMATH DE number 1308950

zbMath0927.05054MaRDI QIDQ4256006

Jitender S. Deogun, Charles Riedesel

Publication date: 5 December 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian cyclespermutation graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

The longest path problem is polynomial on cocomparability graphs ⋮ Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs ⋮ An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm

This page was built for publication: