Key points are not available for this paper at this time.
An equivalent version of the Borodin-Kostochka Conjecture, due to Cranston and Rabern, says that any graph with = = 9 contains K₃ E₆ as a subgraph. Here we prove several results in support of this conjecture, where vertex-criticality and forbidden substructure conditions get us either close or all the way to containing K₃ E₆.
Galindo et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: