Sciweavers

18 search results - page 1 / 4
» Independent sets in triangle-free cubic planar graphs
Sort
View
DM
2008
177views more  DM 2008»
13 years 10 months ago
The independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
Jochen Harant, Michael A. Henning, Dieter Rautenba...
JCT
2006
81views more  JCT 2006»
13 years 10 months ago
Independent sets in triangle-free cubic planar graphs
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...
Christopher Carl Heckman, Robin Thomas
SIAMDM
2010
130views more  SIAMDM 2010»
13 years 9 months ago
On the Hull Number of Triangle-Free Graphs
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
Mitre Costa Dourado, Fábio Protti, Dieter R...
DAM
1999
119views more  DAM 1999»
13 years 10 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
RSA
2002
66views more  RSA 2002»
13 years 10 months ago
Minimum independent dominating sets of random cubic graphs
William Duckworth, Nicholas C. Wormald