Uncrossed chords of cycles in chordal graphs
Abstract
Strongly chordal graphs are characterized here as being the chordal graphs in which the uncrossed chords of a cycle always form a forest (an "independent set of edges"). Ptolemaic graphs are characterized here as being the chordal graphs in which the uncrossed chords of a cycle always form a matching (a "set of independent edges"). Additional characterizations of ptolemaic graphs involve the number of (un)crossed chords. © 2020 Utilitas Mathematica Publishing Inc.. All rights reserved.
Published
2020-03-09
How to Cite
McKee, Terry A. (2020). Uncrossed chords of cycles in chordal graphs. Utilitas Mathematica, 114. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1517
Issue
Section
Articles