✦ LIBER ✦

Counting labelled chordal graphs

✍ Scribed by Nicholas C. Wormald

Book ID: 110567479
Publisher: Springer Japan
Year: 1985
Tongue: English
Weight: 427 KB
Volume: 1
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02582944

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting labelled 3-connected graphs

✍ Nicholas Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB

Labeling Chordal Graphs: Distance Two Co

Labeling Chordal Graphs: Distance Two Condition

✍ Sakai, Denise 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 939 KB

-labeling of dually chordal graphs and s

-labeling of dually chordal graphs and strongly orderable graphs

✍ B.S. Panda; Preeti Goel 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Counting labeled general cubic graphs

✍ Gab-Byung Chae; Edgar M. Palmer; Robert W. Robinson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 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

Partitioning Chordal Graphs

✍ Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 182 KB