✦ LIBER ✦

A note on -vertex critical graphs

✍ Scribed by Rad, Nader Jafari

Book ID: 120608782
Publisher: Informa UK (Taylor & Francis)
Year: 2009
Tongue: English
Weight: 171 KB
Volume: 12
Category: Article
ISSN: 0972-0529
DOI: 10.1080/09720529.2009.10698238

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on vertex pancyclic oriented grap

A note on vertex pancyclic oriented graphs

✍ Bang-Jensen, J�rgen; Guo, Yubao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

Let D be an oriented graph of order n ≥ 9, minimum degree at least n -2, such that, for the choice of distinct vertices x and y, . Graph Theory 18 (1994), 461-468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also

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

Dense critical and vertex-critical graph

Dense critical and vertex-critical graphs

✍ Tommy R. Jensen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 272 KB

On vertex critical graphs with prescribe

On vertex critical graphs with prescribed diameter

✍ L. Caccetta; S. EL-Batanouny; J. Huang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract Let __G__ be connected simple graph with diameter __d__(__G__). __G__ is said __v__^+^‐critical if __d__(__G__−__v__) is greater than __d__(__G__) for every vertex __v__ of __G__. Let D′ = max {__d__(__G__−__v__) : __v__ ∈ __V__(__G__)}. Boals et al. [Congressus Numerantium 72 (1990), 1