Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs

DOI10.1007/11775096_25zbMath1137.68471OpenAlexW1537431299MaRDI QIDQ5434405

Ji Ping Liu, Sheng-Lung Peng, David B. Chandler, Ton Kloks, Maw-Shang Chang

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Sandwich and probe problems for excluding paths ⋮ On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Probe Ptolemaic Graphs ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Partitioned probe comparability graphs ⋮ Recognition of Probe Ptolemaic Graphs ⋮ Probe threshold and probe trivially perfect graphs