Pages that link to "Item:Q3216686"
From MaRDI portal
The following pages link to Polynomial algorithms for perfect graphs (Q3216686):
Displaying 50 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Spectral bounds for the independence ratio and the chromatic number of an operator (Q466129) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Packing paths perfectly (Q757434) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- Completely separable graphs (Q908944) (← links)
- Shuffling biological sequences with motif constraints (Q935837) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Testing membership in matroid polyhedra (Q1056350) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- Relaxations of vertex packing (Q1078206) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Stability number of bull- and chair-free graphs (Q1208469) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- The maximum clique problem (Q1318271) (← links)
