The binding number of a graph and its pancyclism
type: Item
instance of: scholarly article
title: The binding number of a graph and its pancyclism
zbMATH Open document ID: 0626.05052
DOI: 10.1007/BF02007670
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 1987-01-01T00:00:00Z
review text: The binding number is an important parameter of a graph. The binding number of a graph G, bind (G), is the largest real number c such that \(| N(X)| =\min (c| X|,| V(G)|)\) for every \(X\subseteq V(G).\) In this paper, we prove the Woodall's conjecture: In bind (G)\(\geq 3/2\), then G is pancyclic; and obtain some interesting results.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4016957
zbMATH Keywords: binding number
zbMATH Keywords: Woodall's conjecture
author: Ronghua Shi
MaRDI profile type: Publication
cites work: The binding number of a graph and its Anderson number
cites work: The binding number of a graph and its triangle
cites work: The binding number of a graph and its circuits
cites work: Which rational numbers are binding numbers?
cites work: Q3852212
cites work: Q3097395
full work available at URL: https://doi.org/10.1007/bf02007670
OpenAlex ID: W70909835
description: scientific article; zbMATH DE number 4016957