Sparse vertex cutsets and the maximum degree

DOI10.37236/12902MaRDI QIDQ6977160zbMATH OpenFDO

Authors Stéphane Bessy, Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza

Publication date 30 May 2025

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

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

zbMATH Keywords

5-regular connected graphinduced subgraph

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35)

Cites work

• A note on fragile graphs
• Bipartite independence number in graphs with bounded maximum degree
• Extremal graphs having no matching cuts
• Extremal graphs having no stable cutset
• Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
• Fragile graphs with small independent cuts
• Graphs with isomorphic neighbor-subgraphs
• Matching cut in graphs with large minimum degree
• On stable cutsets in claw-free graphs and planar graphs
• On stable cutsets in line graphs
• Recognizing decomposable graphs
• Whitney triangulations, local girth and iterated clique graphs

Cited in

(2)

• On cuts of small chromatic number in sparse graphs
• Forest cuts in sparse graphs

This page was built for publication: Sparse vertex cutsets and the maximum degree

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