𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs

✍ Scribed by J Plesník

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
789 KB
Volume
36
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On simple MCD graphs containing a subgra
On simple MCD graphs containing a subgraph homeomorphic to K4
✍ Yongbing Shi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Let S. be the set of simple graphs on n vertices in which no two cycles have the same length. A graph G in S. is called a simple maximum cycle-distributed (MCD) graph if there exists no graph G' in S. with IE(G')j >IE(G)I. In this paper, we prove that there exists a simple MCD graph on n vertices su

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