✦ LIBER ✦

Dense critical and vertex-critical graphs

✍ Scribed by Tommy R. Jensen

Book ID: 108315750
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 272 KB
Volume: 258
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(02)00262-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex domination-critical graphs

✍ Jason Fulman; Denis Hanson; Gary Macgillivray 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB

Vertex domination-critical graphs

✍ Robert C. Brigham; Phyllis Z. Chinn; Ronald D. Dutton 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

A vertex critical graph without critical

A vertex critical graph without critical edges

✍ Jason I. Brown 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Brown, J.I., A vertical critical graph without critical edges, Discrete Mathematics 102 (1992) 99-101. A vertex k-critical graph is a k-chromatic graph with the property that the removal of any vertex leaves a (k -1)-colourable graph. A critical edge in a graph is an edge whose deletion lowers the c

Paired Domination Vertex Critical Graphs

✍ Xinmin Hou; Michelle Edwards 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 125 KB

Minimum vertex-diameter-2-critical graph

Minimum vertex-diameter-2-critical graphs

✍ Ya-Chen Chen; Zoltán Füredi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

## Abstract We prove that the minimum number of edges in a vertex‐diameter‐2‐critical graph on __n__ ≥ 23 vertices is (5__n__ − 17)/2 if __n__ is odd, and is (5__n__/2) − 7 if __n__ is even. © 2005 Wiley Periodicals, Inc. J Graph Theory

Vertex-critical graphs of given diameter

✍ F. Gliviak 📂 Article 📅 1976 🏛 Akadmiai Kiad 🌐 English ⚖ 484 KB