Probe Ptolemaic Graphs

Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, such that G can be embedded into a graph of G by adding edges between certain nonprobes. In this paper we study the probe graphs of ptolemaic graphs when the partition of vertices is unknown. We present some characterizations of probe ptolemaic graphs and show that there exists a polynomial-time recognition algorithm for probe ptolemaic graphs.

• Type: Conference
• Year: 2008
• Where: COCOON
• Authors: David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng
• Keywords: COCOON 2008, Combinatorics, Probe Graphs, Probe Ptolemaic Graphs, Ptolemaic Graphs