Probe Ptolemaic Graphs

DOI10.1007/978-3-540-69733-6_46MaRDI QIDQ3511358zbMATH OpenOpenAlexFDO

Authors David B. Chandler, Ton Kloks, Van Bang Le, Sheng-Lung Peng, Maw-Shang Chang

Publication date 10 July 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69733-6_46

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Recognition of Probe Ptolemaic Graphs
• Partitioned Probe Comparability Graphs
• Partitioned probe comparability graphs
• Probe threshold and probe trivially perfect graphs
• Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs

Cites work

• scientific article; zbMATH DE number 3152801 (Why is no real title available?)
• scientific article; zbMATH DE number 3880762 (Why is no real title available?)
• scientific article; zbMATH DE number 3906240 (Why is no real title available?)
• scientific article; zbMATH DE number 2119749 (Why is no real title available?)
• scientific article; zbMATH DE number 815104 (Why is no real title available?)
• A Characterization of Certain Ptolemaic Graphs
• A Note on "The Comparability Graph of a Tree"
• A characterization of ptolemaic graphs
• A polynomial time recognition algorithm for probe interval graphs
• A simple linear time algorithm for cograph recognition
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms and Computation
• Characterisations and Linear-Time Recognition of Probe Cographs
• Complement reducible graphs
• Completely separable graphs
• Computing and Combinatorics
• Convexity in Graphs and Hypergraphs
• Distance-hereditary graphs
• Finding houses and holes in graphs
• Graph Classes: A Survey
• On rigid circuit graphs
• Partitioned Probe Comparability Graphs
• Probe split graphs
• Probe threshold and probe trivially perfect graphs
• Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
• STACS 2005
• The Comparability Graph of a Tree
• Theory and Applications of Models of Computation
• Two tricks to triangulate chordal probe graphs in polynomial time

Cited in

(16)

• Chordal probe graphs (extended abstract)
• Partitioned probe comparability graphs
• Algorithms and Computation
• On the probe problem for (r, )-well-coveredness
• Computing and Combinatorics
• Probe split graphs
• Partitioned Probe Comparability Graphs
• Probe threshold and probe trivially perfect graphs
• Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
• STACS 2005
• Chordal probe graphs
• Theory and Applications of Models of Computation
• Characterizing and recognizing probe block graphs
• A characterization of chain probe graphs
• Recognition of Probe Ptolemaic Graphs
• On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity

This page was built for publication: Probe Ptolemaic Graphs

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