𝔖 Bobbio Scriptorium
✦   LIBER   ✦

-labeling of dually chordal graphs and strongly orderable graphs

✍ Scribed by B.S. Panda; Preeti Goel

Book ID
113663365
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
159 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Distance Approximating Trees for Chordal
Distance Approximating Trees for Chordal and Dually Chordal Graphs
✍ Andreas BrandstΓ€dt; Victor Chepoi; Feodor Dragan πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 165 KB

In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G 2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a d

A characterization of strongly chordal g
A characterization of strongly chordal graphs
✍ Elias Dahlhaus; Paul D. Manuel; Mirka Miller πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 119 KB

In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle. (~

Matching and multidimensional matching i
Matching and multidimensional matching in chordal and strongly chordal graphs
✍ Elias Dahlhaus; Marek Karpinski πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 877 KB

Chordal graphs are graphs with the property that each cycle of length greater than 3 has two non-consecutive vertices that are joined by an edge. An important subclass of chordal graphs are strongly chordal graphs (Farber, 1983). Chordal graphs appear for example in the design of acyclic data base s