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 22 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)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← 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)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- On strictly chordality-\(k\) graphs (Q2181248) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- On -sparse graphs and other families (Q3439147) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- Strong cliques in vertex‐transitive graphs (Q6134644) (← links)