Pages that link to "Item:Q2839207"
From MaRDI portal
The following pages link to A new representation of proper interval graphs with an application to clique-width (Q2839207):
Displayed 11 items.
- Dynamic algorithms for monotonic interval scheduling problem (Q476865) (← links)
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- Defensive domination in proper interval graphs (Q2691568) (← links)
- A new representation of proper interval graphs with an application to clique-width (Q2839207) (← links)
- (Q5089227) (← links)
- Tuza's Conjecture for Threshold Graphs (Q6045403) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)