Independent sets in triangle-free cubic planar graphs

13 years 4 months ago

Download math.asu.edu

: 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 by Albertson, Bollob

Christopher Carl Heckman, Robin Thomas

Real-time Traffic

JCT 2006 | Triangle-free Planar Graph |

claim paper

» On the Hull Number of TriangleFree Graphs

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

» Minimum independent dominating sets of random cubic graphs

» Maximum Weight Independent Sets and Matchings in Sparse Random Graphs Exact Results Using ...

» Linear Kernel for Planar Connected Dominating Set

» Cubicity of interval graphs and the claw number

» A pointplacement strategy for conforming Delaunay tetrahedralization

» On Dissemination Thresholds in Regular and Irregular Graph Classes

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Christopher Carl Heckman, Robin Thomas

Comments (0)

Sciweavers

Independent sets in triangle-free cubic planar graphs

JCT 2006 | Triangle-free Planar Graph |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers