Folded chordal graphs

Authors

  • McKee, Terry A.

Abstract

Applications of chordal graphs to seriation and filiation problems are based on intersection graphs of connected subgraphs of (respectively) paths and trees. "Folded chordal" graphs extend these applications by requiring only that the subgraphs be "plausibly connectable," meaning that gaps between components can in a sense be bridged by other relevant connected subgraphs.

Published

1999-06-09

How to Cite

McKee, Terry A. (1999). Folded chordal graphs. Utilitas Mathematica, 56. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/130

Issue

Vol. 56 (1999): Volume 56, 1999

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.