𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On i-minus-Edge-Removal-critical graphs

✍ Scribed by E.J. Cockayne; O. Favaron; C.M. Mynhardt

Book ID
104444527
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
159 KB
Volume
5
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On iβˆ’-ER-critical graphs
On iβˆ’-ER-critical graphs
✍ E.J. Cockayne; O. Favaron; C.M. Mynhardt πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 279 KB
Local edge domination critical graphs
Local edge domination critical graphs
✍ Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 521 KB

Sumner and Blitch defined a graph G to be k-y-critical if 7(G) = k and 7(G + uv) = k -1 for each pair u, v of nonadjacent vertices of G. We define a graph to be k-( 7,d)-critical if 7(G) = k and 7(G + uv) = k -I for each pair u, v of nonadjacent vertices of G that are at distance at most d apart. Th

On Critical Edges in Minimal Imperfect G
On Critical Edges in Minimal Imperfect Graphs
✍ AndrΓ‘s Sebő πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 725 KB

An edge of a graph is called critical, if deleting it the stability number of the graph increases, and a nonedge is called co-critical, if adding it to the graph the size of the maximum clique increases. We prove in this paper, that the minimal imperfect graphs containing certain configurations of t

On the Size of Edge Chromatic Critical G
On the Size of Edge Chromatic Critical Graphs
✍ Daniel P. Sanders; Yue Zhao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 85 KB

In this paper, by applying the discharging method, we prove that if