Triangle-free planar graphs with small independence number
type: Item
instance of: scholarly article
title: Triangle-free planar graphs with small independence number
zbMATH Open document ID: 1402.05044
author: Zdeněk Dvořák
author: Jordan Venters
published in: European Journal of Combinatorics
publication date: 2018-12-20T00:00:00Z
full work available at URL: https://arxiv.org/abs/1702.02888
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6996220
zbMATH Keywords: \(n\)-vertex plane triangle-free graphs
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2594911863
arXiv ID: 1702.02888
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Planar 4-critical graphs with four triangles
cites work: Parameterized Algorithms
cites work: Q4393480
cites work: Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
cites work: 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
cites work: Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
cites work: Large Independent Sets in Triangle-Free Planar Graphs
cites work: Fractional coloring of triangle-free planar graphs
cites work: The structure of 1-planar graphs
cites work: Coloring graphs with fixed genus and girth
cites work: First order properties on nowhere dense structures
cites work: Q5710169
cites work: Quickly excluding a planar graph
cites work: Planar Ramsey numbers
cites work: Three-coloring Klein bottle graphs of girth five
DOI: 10.1016/J.EJC.2018.09.008
description: scientific article