Pages that link to "Item:Q955037"
From MaRDI portal
The following pages link to Matching cutsets in graphs of diameter 2 (Q955037):
Displaying 5 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)
