𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture of Murty and Simon on diameter two critical graphs II

✍ Scribed by Teresa W. Haynes; Michael A. Henning; Anders Yeo

Book ID
113567457
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
250 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Proof of Mader's conjecture on k-critica
Proof of Mader's conjecture on k-critical n-connected graphs
✍ Su Jianji πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 201 KB πŸ‘ 1 views

## Abstract Mader conjectured that every __k__‐critical __n__‐connected noncomplete graph __G__ has __2k__ + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of __G__ is greater than (__k__ + 2)__n__. Now we settle this conjecture completely. Β© 2004 Wiley

On a conjecture of Gallai concerning com
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs
✍ H.L. Abbott; B. Zhou πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 418 KB

Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k-critical graphs, Discrete Mathematics 100 (1992) 223-228. A graph G is said to be k-critical if it has chromatic number k but every proper subgraph of G has a (k -l)-coloring. T. Gallai asked whether each k-criti