Revisiting extremal graphs having no stable cutsets

DOI10.37236/13629MaRDI QIDQ6901237zbMATH OpenFDO

Authors Johannes Rauch, Dieter Rautenbach

Publication date 12 November 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13629

zbMATH Keywords

generating sequences

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

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
• Stable set bonding in perfect graphs and parity graphs

Cited in

(1)

• Stable cuts, NAC-colourings and flexible realisations of graphs

This page was built for publication: Revisiting extremal graphs having no stable cutsets

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