Finding Intersection Models of Weakly Chordal Graphs

We first present new structural properties of a two-pair in various graphs. A two-pair is used for characterizing weakly chordal graphs. Based on these properties, we prove the main theorem: a graph G is a weakly chordal (K2,3, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Golumbic, Martin Charles, Lipshteyn, Marina, Stern, Michal
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Exact sciences and technology Information retrieval. Graph Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!