Algorithms and Computation

DOI10.1007/11602613zbMath1173.05355OpenAlexW2304246803MaRDI QIDQ5897852

Ryuhei Uehara, Yushi Uno

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

zbMATH Keywords

Hamiltonian cyclealgorithmic graph theorydata structurePtolemaic graphsintersection model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Towards a characterization of leaf powers by clique arrangements ⋮ Probe Ptolemaic Graphs ⋮ Characterizing and computing the structure of clique intersections in strongly chordal graphs ⋮ The clique-separator graph for chordal graphs

This page was built for publication: Algorithms and Computation