Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The binding number of a graph and its triangle

The binding number of a graph and its triangle In this paper we prove the following conjecture of Woodall[1]: if bind (G)≥3/2, thenG contains a triangle. Moreover we also prove that if bind (G)≥3/2, then each vertex is contained in a 4-cycle, each edge is contained in a 5-cycle whenV(G)≥11, and there exists a 6-cycle inG. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

The binding number of a graph and its triangle

Acta Mathematicae Applicatae Sinica , Volume 2 (1) – Apr 26, 2005

Loading next page...
 
/lp/springer-journals/the-binding-number-of-a-graph-and-its-triangle-ATtAejLX6h
Publisher
Springer Journals
Copyright
Copyright © 1985 by Science Press and D. Reidel Publishing Company
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF01666521
Publisher site
See Article on Publisher Site

Abstract

In this paper we prove the following conjecture of Woodall[1]: if bind (G)≥3/2, thenG contains a triangle. Moreover we also prove that if bind (G)≥3/2, then each vertex is contained in a 4-cycle, each edge is contained in a 5-cycle whenV(G)≥11, and there exists a 6-cycle inG.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Apr 26, 2005

References