Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs

DOI10.1007/11775096_25MaRDI QIDQ5434405zbMATH OpenOpenAlexFDO

Authors David B. Chandler, Ton Kloks, Jiping Liu, Sheng-Lung Peng, 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Recognition of probe distance-hereditary graphs
• Characterisations and Linear-Time Recognition of Probe Cographs
• Partitioned probe comparability graphs
• Partitioned Probe Comparability Graphs
• Probe Ptolemaic Graphs

Cited in

(11)

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

This page was built for publication: Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434405)