Cycle isolation of graphs with small girth

DOI10.1007/s00373-024-02768-7OpenAlexW4393192673MaRDI QIDQ6131294

Baoyindureng Wu, Gang Zhang

Publication date: 4 April 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-024-02768-7

zbMATH Keywords

dominationdecycling setsmall girthcycle isolation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• A lower bound on the order of the largest induced forest in planar graphs with high girth
• Induced forests in bipartite planar graphs
• Minimum size of feedback vertex sets of planar graphs of girth at least five
• Large induced forests in planar graphs with girth 4
• A better bound on the largest induced forests in triangle-free planar graph
• Admissible property of graphs in terms of radius
• Admissible property of graphs in terms of independence number
• Isolation of the diamond graph
• Isolation of \(k\)-cliques. II
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• \( K_{1 , 2}\)-isolation in graphs
• Isolation number of maximal outerplanar graphs
• Extensions of the Art Gallery Theorem
• Large induced forests in sparse graphs
• Size of the largest induced forest in subcubic graphs of girth at least four and five
• Large Induced Forests in Graphs
• Partial domination - the isolation number of a graph
• \( P_5\)-isolation in graphs
• A sharp upper bound on the cycle isolation number of graphs
• A note on the cycle isolation number of graphs

This page was built for publication: Cycle isolation of graphs with small girth