The following pages link to (Q4484907):
Displaying 50 items.
- Exploring the concept of perfection in 3-hypergraphs (Q299076) (← links)
- Even pairs in square-free Berge graphs (Q322216) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- A new characterization of perfect graphs (Q442410) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- From monomials to words to graphs. (Q598451) (← links)
- Satgraphs and independent domination. I (Q818113) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Bisimplicial vertices in even-hole-free graphs (Q958679) (← links)
- On cover-structure graphs (Q967385) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Polyhedral results on the stable set problem in graphs containing even or odd pairs (Q1785209) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- Corrigendum to: ``Bisimplicial vertices in even-hole-free graphs'' (Q1985455) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number (Q2231756) (← links)
- Gallai-Ramsey numbers for books (Q2274089) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- Line-graphs of cubic graphs are normal (Q2427494) (← links)
- Kernels and perfectness in arc-local tournament digraphs (Q2433708) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Distinct degrees and homogeneous sets (Q2680569) (← links)
- Largest Eigenvalue of the Laplacian Matrix: Its Eigenspace and Transitive Orientations (Q2835840) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- Excluding Induced Subdivisions of the Bull and Related Graphs (Q2911052) (← links)
- Vertex decomposable graphs and obstructions to shellability (Q3182562) (← links)
- On strongly circular-perfectness (Q3439367) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- Random perfect graphs (Q4625032) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- The perfection and recognition of bull-reducible Berge graphs (Q4680732) (← links)
