Recognition of Probe Ptolemaic Graphs

DOI10.1007/978-3-642-19222-7_29MaRDI QIDQ3000516zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Recognition of probe proper interval graphs
• Probe Ptolemaic Graphs
• New results on Ptolemaic graphs
• Algorithms and Computation
• A polynomial time recognition algorithm for probe interval graphs
• The recognition of geodetically connected graphs
• Laminar structure of ptolemaic graphs with applications
• Recognition of probe distance-hereditary graphs

Cites work

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

Cited in

(4)

• Recognition of probe distance-hereditary graphs
• Probe Ptolemaic Graphs
• New results on Ptolemaic graphs
• Algorithms and Computation

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

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