Pages that link to "Item:Q2553372"
From MaRDI portal
The following pages link to A characterization of perfect graphs (Q2553372):
Displaying 50 items.
- On the independence polynomial of the corona of graphs (Q260027) (← links)
- An extension of Lehman's theorem and ideal set functions (Q298985) (← 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)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Vertex-transitive CIS graphs (Q472401) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Perfect commuting graphs (Q528911) (← links)
- Duality and perfection for edges in cliques (Q595674) (← links)
- Perfect \(0,\pm 1\) matrices (Q677152) (← links)
- Preperfect graphs (Q684406) (← links)
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- On generalized perfect graphs: Bounded degree and bounded edge perfection (Q686267) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Perfect graphs involving semitotal and semipaired domination (Q721925) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- On circular critical graphs (Q796546) (← links)
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- Tolerance graphs (Q798675) (← links)
- Graph models for scheduling systems with machine saturation property (Q883067) (← links)
- Entropy of symmetric graphs (Q898092) (← links)
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs (Q911763) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Even pairs in Berge graphs (Q1003839) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- Lehman matrices (Q1025999) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- On a geometric property of perfect graphs (Q1053035) (← links)
- Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- New classes of perfect graphs (Q1087552) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Wings and perfect graphs (Q1112849) (← links)
- Opposition graphs are strict quasi-parity graphs (Q1118614) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Zur Theorie der perfekten Graphen (Q1134773) (← links)
- The strong perfect graph conjecture for toroidal graphs (Q1159682) (← links)
- A classification of certain graphs with minimal imperfection properties (Q1160632) (← links)
- On the strong perfect graph conjecture and critical graphs (Q1165250) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
