✦ LIBER ✦

On 4--critical graphs of diameter two

✍ Scribed by Wang, Yan; Wang, Chunxiang

Book ID: 122419257
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 865 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.01.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On diameter critical graphs

✍ Louis Caccetta; Roland Häggkvist 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 520 KB

On diameter 2-critical graphs

✍ Genghua Fan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A graph is diameter 2-critical if the graph has diameter 2 and the deletion of any edge increases its diameter. We prove that if G is diameter 2-critical graph on n vertices and e edges, then (i) e ~< [14n2 ] for n <~ 24, and (ii) e < !4n2 + (n 2 -16.2 n + 56)/320 (<0.2532 n2), for n/> 25.

On Critical Graphs of Diameter 2

✍ U. S. R. Murty 📂 Article 📅 1968 🏛 Mathematical Association of America 🌐 English ⚖ 337 KB

Maximal and Minimal Vertex-Critical Grap

Maximal and Minimal Vertex-Critical Graphs of Diameter Two

✍ Jing Huang; Anders Yeo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 446 KB

A graph is vertex-critical if deleting any vertex increases its diameter. We construct, for each & 5 except &=6, a vertex-critical graph of diameter two on & vertices with at least , where c 2 is some constant. We also construct, for each & 5 except &=6, a vertex-critical graph of diameter two on &

On 3-diameter-stable graphs of diameter

On 3-diameter-stable graphs of diameter 4

✍ Cheng-de Xu; Rui Gu 📂 Article 📅 2010 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 110 KB

Graphs of diameter two with no 4-circuit

Graphs of diameter two with no 4-circuits

✍ J.A. Bondy; P. Erdös; S. Fajtlowicz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 219 KB