Extremal graphs having no stable cutset

zbMath1266.05073MaRDI QIDQ1953420

Van Bang Le, Florian Pfender

Publication date: 7 June 2013

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p35

zbMATH Keywords

extremal graphstable cutsetfragile graphindependent cutset

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (2)

Algorithms Solving the Matching Cut Problem ⋮ Algorithms solving the matching cut problem

This page was built for publication: Extremal graphs having no stable cutset