Recognition of Probe Ptolemaic Graphs

DOI10.1007/978-3-642-19222-7_29zbMath1326.05150OpenAlexW2287165951MaRDI QIDQ3000516

Ling-Ju Hung, Maw-Shang Chang

Publication date: 19 May 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_29

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Partitioned probe comparability graphs
• On probe permutation graphs
• Probe threshold and probe trivially perfect graphs
• Distance-hereditary graphs
• Characterisations and Linear-Time Recognition of Probe Cographs
• Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
• A characterization of ptolemaic graphs
• Graph Sandwich Problems
• Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
• Probe Matrix Problems: Totally Balanced Matrices
• STACS 2005
• Linear-Time Recognition of Probe Interval Graphs

This page was built for publication: Recognition of Probe Ptolemaic Graphs