✦ LIBER ✦

Labeling Chordal Graphs: Distance Two Condition

✍ Scribed by Sakai, Denise

Book ID: 118198917
Publisher: Society for Industrial and Applied Mathematics
Year: 1994
Tongue: English
Weight: 939 KB
Volume: 7
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480191223178

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A survey on labeling graphs with a condi

A survey on labeling graphs with a condition at distance two

✍ Roger K. Yeh 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Counting labelled chordal graphs

✍ Nicholas C. Wormald 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 427 KB

Labeling Planar Graphs without 4,5-Cycle

Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two

✍ Zhu, Hai-Yang; Lu, Xin-Zhong; Wang, Cui-Qi; Chen, Ming 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 609 KB

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

Labeling Planar Graphs with Conditions o

Labeling Planar Graphs with Conditions on Girth and Distance Two

✍ Wang, Wei-Fan; Lih, Ko-Wei 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 168 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