On simple MCD graphs containing a subgraph homeomorphic to K4

✍ Scribed by Yongbing Shi

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 807 KB
• Volume: 126
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(94)90275-5

✦ Synopsis

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 such that it is a 2-connected graph containing a subgraph homeomorphic to K, if and only if nc{lO, 11,14,15,16,21,22}.