On economical set representations of graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2009

On economical set representations of graphs

Abstract

In this paper we discuss the bounds of and relations among various kinds of intersection numbers of graphs. Especially, we address extremal graphs with respect to the established bounds. The uniqueness of the minimum-size intersection representations for some graphs is also studied. In the course of this work, we introduce a superclass of chordal graphs, defined in terms of a generalization of simplicial vertex and perfect elimination ordering.
Fichier principal
Vignette du fichier
946-4372-4-PB.pdf (323.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00988208 , version 1 (07-05-2014)

Identifiers

Cite

Jing Kong, Yaokun Wu. On economical set representations of graphs. Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 2 (2), pp.71--95. ⟨10.46298/dmtcs.451⟩. ⟨hal-00988208⟩

Collections

TDS-MACS
77 View
871 Download

Altmetric

Share

Gmail Facebook X LinkedIn More