Pages that link to "Item:Q995581"
From MaRDI portal
The following pages link to NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581):
Displaying 12 items.
- Harmonious colourings of graphs (Q516809) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- The micro-world of cographs (Q831855) (← links)
- A boundary class for the \(k\)-path partition problem (Q1791978) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
