Download:
|
by Anne Berry, Jean-paul Bordat
Discrete Applied Mathematics
http://www.lirmm.fr/~aberry/atm.ps
Add To MetaCart
Abstract:
An asteroidal triple is an independent set of vertices such that each pair is joined by a path that avoids the neighborhood of the third, and a moplex is an extension to an arbitrary graph of a simplicial vertex in a triangulated graph. The main result of this paper is that the investigation of the set of moplexes of a graph is sufficient to conclude as to its having an asteroidal triple. Specifically, we show that a graph has an asteroidal triple of vertices if and only if it has an asteroidal triple of moplexes. We also examine the behavior of an asteroidal triple of moplexes in the course of a minimal triangulation process, and give some related properties.
Citations
|
880
|
Algorithmic Graph Theory and Perfect Graphs
– Golumbic
- 1980
|
|
252
|
S.[1976]. “Algorithmic Aspects of Vertex Elimination on Graphs
– Rose, Tarjan, et al.
|
|
97
|
Representation of a finite graph by a set of intervals on the real line, Fund
– Lekkerkerker, Boland
- 1962
|
|
93
|
On Rigid Circuit Graphs
– Dirac
- 1961
|
|
56
|
Indifference graphs
– Roberts
- 1969
|
|
36
|
Substitution decomposition on chordal graphs and applications
– Hsu
|
|
29
|
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
– Corneil, Olariu, et al.
- 1995
|
|
29
|
H.: Approximating the bandwidth for asteroidal triple-free graphs
– Kloks, Kratsch, et al.
|
|
27
|
Tolerance Graphs
– Golumbic, Trenk
- 2004
|
|
23
|
Desarticulation d'un graphe
– Berry
- 1998
|
|
18
|
Separability generalizes Dirac's theorem
– Berry, Bordat
- 1998
|
|
17
|
On treewidth and minimum fill-in of asteroidal triple-free graphs, Theor
– KLOKS, KRATSCH, et al.
- 1997
|
|
17
|
Structural and algorithmic aspects of chordal graph embeddings
– Parra
- 1996
|
|
12
|
Treewidth and pathwidth of cocomparability graphs of bounded dimension
– Kloks, Kratsch, et al.
|
|
6
|
Triangulating graphs without asteroidal triples
– Mohring
- 1996
|
|
5
|
On the structure of graphs with bounded asteroidal number
– Kloks, Kratsch, et al.
- 1997
|
|
5
|
Asteroidal sets in graphs
– Kloks, Kratsch, et al.
- 1997
|
|
4
|
A characterization of unbreakable graphs by their moplex set. Res. Rep. 98266
– Berry, Bordat
|
|
4
|
Asteroidal triple free graphs
– Corneil, Olariu, et al.
- 1997
|
|
3
|
Properties of iterative minimal separator completion
– Berry, Bordat
- 1998
|
|
2
|
Triangulating graphs without asteroidal triples
– Mhring
- 1996
|
