Searching for "Characterizations of strongly chordal graphs." – sorted by Relevance.
7 documents found, showing 1 through 7.
-
New Proofs for Strongly Chordal Graphs and Chordal Bipartite Graphs
- …-known characterizations of strongly chordal graphs and chordal bipartite graphs. The key ingredient is the dual hypertree…
- Cited by 2 (0 self) – Add To MetaCart
-
Generalized Strongly Chordal Graphs
- … to characterize generalized strongly chordal graphs by forbidden subgraphs and to compute a generalized strongly…
- Cited by 2 (0 self) – Add To MetaCart
-
From a simple elimination ordering to a strong elimination ordering in linear time
- … chordal graph into a strong elimination ordering. © 2003 Elsevier Science B.V. All rights reserved…
- Cited by 1 (0 self) – Add To MetaCart
-
Additive Tree Spanners
- … and the interval graphs, see [7] for definition and characterizations. Strongly chordal graphs allow 3additive…
- Cited by 9 (0 self) – Add To MetaCart
-
On Powers of Chordal Graphs And Their Colorings
- … characterization of strongly chordal graphs in terms of totally balanced matrices is given in [8], where strongly…
- Cited by 21 (1 self) – Add To MetaCart
-
Disjoint and Fold Domination in Graphs
- …) is combinatorial. One of the characterizations of strongly chordal graphs states that these graphs allow strong…
- Cited by 1 (0 self) – Add To MetaCart
-
AND
- … and sun-free. See Brandstädt et al. [1999] for various characterizations of (strongly) chordal graphs. 3…
- Add To MetaCart
Showing 1 through 7.
