The following pages link to Recognizing decomposable graphs (Q3320412):
Displayed 14 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Stable skew partition problem (Q1887035) (← links)
- Bisplit graphs (Q2568470) (← links)
- Extremal graphs having no matching cuts (Q3113291) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- (Q5708527) (← links)