Ptolemaic graph
In graph theory, a Ptolemaic graph is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the Greek astronomer and mathematician Ptolemy. The Ptolemaic graphs are exactly the graphs that are both chordal and distance-hereditary; they include the block graphs and are a subclass of the perfect graphs.
Link from a Wikipage to another Wikipage
primaryTopic
Ptolemaic graph
In graph theory, a Ptolemaic graph is an undirected graph whose shortest path distances obey Ptolemy's inequality, which in turn was named after the Greek astronomer and mathematician Ptolemy. The Ptolemaic graphs are exactly the graphs that are both chordal and distance-hereditary; they include the block graphs and are a subclass of the perfect graphs.
has abstract
In graph theory, a Ptolemaic g ...... ubclass of the perfect graphs.
@en
Wikipage page ID
50,730,814
page length (characters) of wiki page
Wikipage revision ID
985,561,056
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
In graph theory, a Ptolemaic g ...... ubclass of the perfect graphs.
@en
label
Ptolemaic graph
@en