Induced 2-degenerate subgraphs of triangle-free planar graphs

zbMath1391.05092arXiv1709.04036MaRDI QIDQ1753031

Tom Kelly, Zdeněk Dvořák

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.04036

zbMATH Keywords

planar graphscoloring numberdischarginggraph degeneracy

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

3‐Degenerate induced subgraph of a planar graph

Cites Work

• Planar graphs have independence ratio at least 3/13
• Maximum 4-degenerate subgraph of a planar graph
• Induced forests in bipartite planar graphs
• Minimum size of feedback vertex sets of planar graphs of girth at least five
• Independence in graphs with maximum degree four
• Large induced degenerate subgraphs
• Maximum induced forests of planar graphs
• Planar Ramsey numbers
• A better bound on the largest induced forests in triangle-free planar graph
• A lower bound for the independence number of a planar graph
• Every planar map is four colorable
• Large Independent Sets in Triangle-Free Planar Graphs

This page was built for publication: Induced 2-degenerate subgraphs of triangle-free planar graphs