Forest cuts in sparse graphs

DOI10.1016/J.DISC.2025.114594MaRDI QIDQ6972377zbMATH OpenFDO

Authors Vsevolod L. Chernyshev, Johannes Rauch, Dieter Rautenbach

Publication date 12 June 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114594

zbMATH Keywords

forest cutindependent cut

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• A note on fragile graphs
• Coloring graphs with stable cutsets
• Exact and Parameterized Algorithms for the Independent Cutset Problem
• Extremal graphs having no stable cutset
• Finding small separators in linear time via treewidth reduction
• Fragile graphs with small independent cuts
• scientific article; zbMATH DE number 1161313 (Why is no real title available?)
• On polynomial kernelization for stable cutset
• On stable cutsets in claw-free graphs and planar graphs
• On stable cutsets in graphs
• On stable cutsets in line graphs
• Recognizing decomposable graphs
• Sparse vertex cutsets and the maximum degree
• Stable set bonding in perfect graphs and parity graphs

Cited in

(3)

• On cuts of small chromatic number in sparse graphs
• Sparse graphs with an independent or foresty minimum vertex cut
• Stable cuts, NAC-colourings and flexible realisations of graphs

This page was built for publication: Forest cuts in sparse graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972377)