Partitioned Probe Comparability Graphs

DOI10.1007/11917496_17MaRDI QIDQ3522955zbMATH OpenOpenAlexFDO

Authors David B. Chandler, Ton Kloks, Jiping Liu, Sheng-Lung Peng, Maw-Shang Chang

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Partitioned probe comparability graphs
• Theory and Applications of Models of Computation
• On probe permutation graphs
• Probe Ptolemaic Graphs
• Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs

Cited in

(11)

• Characterisations and Linear-Time Recognition of Probe Cographs
• Probe Ptolemaic Graphs
• Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
• Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
• STACS 2005
• Computing and Combinatorics
• Theory and Applications of Models of Computation
• Chordal probe graphs (extended abstract)
• Two characterizations of chain partitioned probe graphs
• The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy
• Partitioned probe comparability graphs

This page was built for publication: Partitioned Probe Comparability Graphs

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