✦ LIBER ✦

Centers of chordal graphs

✍ Scribed by Gerard J. Chang

Publisher: Springer Japan
Year: 1991
Tongue: English
Weight: 505 KB
Volume: 7
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01787637

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

About a conjecture on the centers of cho

About a conjecture on the centers of chordal graphs

✍ K. S. Parvathy; A. Remadevi; A. Vijayakumar 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 81 KB

Equistable chordal graphs

✍ Uri N. Peled; Udi Rotics 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a chordal graph is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial

Strongly chordal and chordal bipartite g

Strongly chordal and chordal bipartite graphs are

✍ Pinar Heggernes; Federico Mancini; Charis Papadopoulos; R. Sritharan 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 634 KB

Chordal graphs, interval graphs, and wqo

✍ Ding, Guoli 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 1 views

Let be the induced-minor relation. It is shown that, for every t, all chordal graphs of clique number at most t are well-quasi-ordered by . On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by .

Restricted unimodular chordal graphs

✍ Peled, Uri N.; Wu, Julin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 1 views

A chordal graph is called restricted unimodular if each cycle of its vertex-clique incidence bipartite graph has length divisible by 4. We characterize these graphs within all chordal graphs by forbidden induced subgraphs, by minimal relative separators, and in other ways. We show how to construct t