scientific article; zbMATH DE number 2105044

zbMath1053.05093MaRDI QIDQ4820877

Edy Tri Baskoro, A. N. M. Salman, Hajo J. Broersma

Publication date: 1 October 2004

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

zbMATH Keywords

Hamilton cyclegrid graphalphabet graphminimum spanning 2-connected subgraph

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 (4)

A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs

This page was built for publication: