New formulae for the bipartite vertex frustration and decycling number of graphs
From MaRDI portal
Publication:2008493
DOI10.1016/j.amc.2018.10.082zbMath1428.05148OpenAlexW2900618343MaRDI QIDQ2008493
Fayun Cao, Han Ren, Han Lin Chen
Publication date: 26 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.10.082
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- The decycling number of generalized Petersen graphs
- Extremal properties of the bipartite vertex frustration of graphs
- Extremal graphs with bounded vertex bipartiteness number
- Bipartite subgraphs of graphs with maximum degree three
- A new bound on the feedback vertex sets in cubic graphs
- A new formula for the decycling number of regular graphs
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs of triangle-free subcubic graphs
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- Feedback vertex sets and cyclically reducible graphs
- Maximumk-colorable subgraphs
- Extremal bipartite subgraphs of cubic triangle-free graphs
- On the bipartite density of regular graphs with large girth
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Node-and edge-deletion NP-complete problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New formulae for the bipartite vertex frustration and decycling number of graphs
