Recognition of Probe Ptolemaic Graphs

DOI10.1007/978-3-642-19222-7_29zbMATH Open1326.05150OpenAlexW2287165951MaRDI QIDQ3000516FDOQ3000516

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

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
• Linear-Time Recognition of Probe Interval Graphs
• Linear-Time Recognition of Probe Interval Graphs
• The recognition of geodetically connected graphs
• Laminar structure of ptolemaic graphs with applications
• Recognition of probe distance-hereditary graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)