✦ LIBER ✦

A Dirac-type characterization of -chordal graphs

✍ Scribed by Krithika, R.; Mathew, Rogers; Narayanaswamy, N.S.; Sadagopan, N.

Book ID: 121315944
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 359 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.08.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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. (~

Some characterizations of doubly chordal

Some characterizations of doubly chordal graphs

✍ Lee, Mahnhoon ;Kim, Changhwa 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 102 KB

A good characterization of squares of st

A good characterization of squares of strongly chordal split graphs

✍ Van Bang Le; Ngoc Tuy Nguyen 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 141 KB

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 dirac-type theorem for squares of grap

A dirac-type theorem for squares of graphs

✍ Tomasz Traczyk Jr. 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

We prove that if G is a connected graph with p vertices and minimum degree greater than max( p/4 -1,3) then G2 is pancyclic. The result is best possible of its kind.

Generating and characterizing the perfec

Generating and characterizing the perfect elimination orderings of a chordal graph

✍ L.S. Chandran; L. Ibarra; F. Ruskey; J. Sawada 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

We develop a constant time transposition "oracle" for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the