Planar graphs without chordal 5-cycles are 2-good (Q1743499): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wei Fan Wang / rank
Normal rank
 
Property / author
 
Property / author: Yi Qiao Wang / rank
Normal rank
 
Property / author
 
Property / author: Wei Fan Wang / rank
 
Normal rank
Property / author
 
Property / author: Yi Qiao Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-017-0243-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2787771914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firefighter problem with more than one firefighter on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Surviving Rate of a Graph for the Firefighter Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More fires and more fighters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fire Containment in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firefighter problem for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph is on fire / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of plane graphs under distance restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio k-chromatic number of cycles for large k / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firefighter problem for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The surviving rate of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties and surviving rate of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Graphs Are Not Flammable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain parameters of equitable coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum vertex covering transversal dominating sets in graphs and their classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The surviving rate of an infected network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-surviving rate of planar graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound of the surviving rate of a planar graph with girth at least seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-surviving rate of planar graphs without 6-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-surviving rate of planar graphs without 5-cycles / rank
 
Normal rank

Latest revision as of 11:12, 15 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs without chordal 5-cycles are 2-good
scientific article

    Statements

    Planar graphs without chordal 5-cycles are 2-good (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2018
    0 references
    firefighter problem
    0 references
    surviving rate
    0 references
    planar graph
    0 references
    cycle
    0 references
    chord
    0 references

    Identifiers