𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for a plane graph with maximum degree 6 to be class 1

✍ Scribed by Yingqian Wang; Lingji Xu

Book ID
119225056
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
192 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sufficient condition for a regular gra
A sufficient condition for a regular graph to be class 1
✍ A. J. W. Hilton; Cheng Zhao πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 553 KB

## Abstract The core __G__Ξ” of a simple graph __G__ is the subgraph induced by the vertices of maximum degree. It is well known that the Petersen graph is not 1‐factorizable and has property that the core of the graph obtained from it by removing one vertex has maximum degree 2. In this paper, we p

A necessary and sufficient condition for
A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
✍ Zhou Huai-Lu πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 272 KB πŸ‘ 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,