✦ LIBER ✦

About a conjecture on the centers of chordal graphs

✍ Scribed by K. S. Parvathy; A. Remadevi; A. Vijayakumar

Publisher: Springer Japan
Year: 1994
Tongue: English
Weight: 81 KB
Volume: 10
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02986676

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On powers and centers of chordal graphs

✍ Renu Laskar; Douglas Shier 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 486 KB

On the chordality of a graph

✍ Terry A. McKee; Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 574 KB

## Abstract The __chordality__ of a graph __G__ = (__V, E__) is defined as the minimum __k__ such that we can write __E__ = __E__~1~ ∩ … ∩ __E__~__k__~ with each (__V, E__~__i__~) a chordal graph. We present several results bounding the value of this generalization of boxicity. Our principal result

A remark on Mulder's conjecture about in

A remark on Mulder's conjecture about interval-regular graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let F be a connected graph. F is said to be interval-regular if I F~\_ l(u) uF(x )J =. i holds for all vertices u and x ~ Fi(u), i > 0. For u, v e F, let I (u, v) denote the set of all vertices on a shortest path connecting u, v. A subset W of V(F) is said to be convex if l(u,v) c W holds for each u

On the pathwidth of chordal graphs

✍ Jens Gusted 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 927 KB

On the Hyperbolicity of Chordal Graphs

✍ Gunnar Brinkmann<ORF RID="A1">; Jack H. Koolen<ORF RID="A1"> 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 115 KB

On the interval number of a chordal grap

On the interval number of a chordal graph

✍ Edward R. Scheinerman 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB 👁 2 views

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum