๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Two methods for the generation of chordal graphs

โœ Scribed by Lilian Markenzon; Oswaldo Vernet; Luiz Henrique Araujo

Book ID
106344467
Publisher
Springer US
Year
2007
Tongue
English
Weight
317 KB
Volume
157
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A generalization of chordal graphs
A generalization of chordal graphs
โœ P. D. Seymour; R. W. Weaver ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 487 KB

In a 3-connected planar triangulation, every circuit of length 2 4 divides the rest of the edges into two nontrivial parts (inside and outside) which are "separated" by the circuit. Neil Robertson asked to what extent triangulations are characterized by this property, and conjectured an answer. In t

A generalization of chordal graphs and t
A generalization of chordal graphs and the maximum clique problem
โœ Assef Chmeiss; Philippe Jรฉgou ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 584 KB

A graph is chordal or triangulated if it has no chordless cycle with four or more vertices. Chordal graphs are well known for their combinatorial and algorithmic properties. Here we introduce a generalization of chordal graphs, namely CSGk graphs. Informally, a CSG' graph is a complete graph, and fo

Clique Graphs of Chordal and Path Graphs
Clique Graphs of Chordal and Path Graphs
โœ Szwarcfiter, Jayme L.; Bornstein, Claudson F. ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 739 KB