Pages that link to "Item:Q955037"

The following pages link to Matching cutsets in graphs of diameter 2 (Q955037):

Displaying 14 items.

• Improper C-colorings of graphs (Q629357) (← links)
• 3-consecutive edge coloring of a graph (Q658096) (← links)
• Algorithms solving the matching cut problem (Q897900) (← links)
• Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
• A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← 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)
• Matching cut in graphs with large minimum degree (Q5925521) (← links)
• Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
• \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
• Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)