Pages that link to "Item:Q1339397"
From MaRDI portal
The following pages link to Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397):
Displaying 9 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
