Planar graphs without chordal 5-cycles are 2-good
type: Item
instance of: scholarly article
title: Planar graphs without chordal 5-cycles are 2-good
zbMATH Open document ID: 1393.05094
author: Tingting Wu
author: Xiaoxue Hu
author: Weifan Wang
author: Yiqiao Wang
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6859599
zbMATH Keywords: firefighter problem
zbMATH Keywords: surviving rate
zbMATH Keywords: planar graph
zbMATH Keywords: cycle
zbMATH Keywords: chord
MaRDI profile type: Publication
full work available at URL: s10878-017-0243-9
OpenAlex ID: W2787771914
cites work: The firefighter problem with more than one firefighter on trees
cites work: The Surviving Rate of a Graph for the Firefighter Problem
cites work: Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
cites work: More fires and more fighters
cites work: Fire Containment in Planar Graphs
cites work: Q3614015
cites work: The firefighter problem for graphs of maximum degree three
cites work: Planar graph is on fire
cites work: A note on 3-choosability of plane graphs under distance restrictions
cites work: Radio k-chromatic number of cycles for large k
cites work: The firefighter problem for cubic graphs
cites work: The surviving rate of planar graphs
cites work: Structural properties and surviving rate of planar graphs
cites work: A Separator Theorem for Planar Graphs
cites work: Sparse Graphs Are Not Flammable
cites work: On certain parameters of equitable coloring of graphs
cites work: On the minimum vertex covering transversal dominating sets in graphs and their classification
cites work: The surviving rate of an infected network
cites work: The 2-surviving rate of planar graphs without 4-cycles
cites work: A lower bound of the surviving rate of a planar graph with girth at least seven
cites work: The 2-surviving rate of planar graphs without 6-cycles
cites work: The 2-surviving rate of planar graphs without 5-cycles
DOI: 10.1007/S10878-017-0243-9
Recommended article: Planar graphs without intersecting 5-cycles are 4-choosable
Recommended article: Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Recommended article: Planar graphs without 5-cycles or without 6-cycles
Recommended article: Edge colorings of planar graphs without 5-cycles with two chords
Recommended article: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
Recommended article: Edge choosability of planar graphs without 5-cycles with a chord
Recommended article: Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable
Recommended article: The linear arboricity of planar graphs without 5-cycles with two chords
Recommended article: Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
Recommended article: Acyclic 5-choosability of planar graphs without 4-cycles
description: scientific article; zbMATH DE number 6859599