Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
27
click to vote
DMTCS
2010
133
views
Mathematics
»
more
DMTCS 2010
»
An improved bound on the largest induced forests for triangle-free planar graphs
13 years 8 months ago
Download
www.fmf.uni-lj.si
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of S...
Lukasz Kowalik, Borut Luzar, Riste Skrekovski
claim paper
Read More »