The following pages link to (Q4484907):
Displaying 15 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)
- 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)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- Even-hole-free graphs still have bisimplicial vertices (Q6038593) (← links)
