Pages that link to "Item:Q6174803"
From MaRDI portal
The following pages link to Complexity of maximum cut on interval graphs (Q6174803):
Displaying 6 items.
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- MaxCut on permutation graphs is NP‐complete (Q6047965) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
- Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes (Q6549667) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
