Pages that link to "Item:Q3956856"

The following pages link to Networks immune to isolated line failures (Q3956856):

Displaying 14 items.

• Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphs (Q864162) (← links)
• Algorithms solving the matching cut problem (Q897900) (← links)
• Forbidden minors characterization of partial 3-trees (Q913807) (← links)
• On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
• Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
• On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
• A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
• A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
• On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
• Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
• Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
• Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
• (Q5009482) (← links)
• Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)