The following pages link to Strongly perfect graphs (Q3222875):
Displaying 50 items.
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs (Q411837) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures (Q411838) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- A note on graphs which have upper irredundance equal to independence (Q686250) (← links)
- Weakly triangulated graphs (Q801088) (← links)
- Perfectly contractile graphs (Q803147) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- Clique-transversal sets of line graphs and complements of line graphs (Q810533) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- A class of strongly perfect graphs (Q1060228) (← links)
- A note on superbrittle graphs (Q1081614) (← links)
- New classes of perfect graphs (Q1087552) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On a conjecture of Meyniel (Q1096652) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Paw-free graphs (Q1108293) (← links)
- A fast algorithm for coloring Meyniel graphs (Q1111563) (← links)
- Star-cutsets and perfect graphs (Q1121289) (← links)
- Slim graphs (Q1123217) (← links)
- A note on perfect orders (Q1124614) (← links)
- Perfect graphs are kernel solvable (Q1126176) (← links)
- Meyniel graphs are strongly perfect (Q1171076) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) (Q1175981) (← links)
- New properties of perfectly orderable graphs and strongly perfect graphs (Q1185094) (← links)
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations (Q1208351) (← links)
- On sources in comparability graphs, with applications (Q1208375) (← links)
- Some classes of strongly perfect graphs (Q1304823) (← links)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- Even and odd pairs in linegraphs of bipartite graphs (Q1345522) (← links)
- Strong perfectness of the generalized Cartesian product of graphs (Q1356708) (← links)
- Path parity and perfection (Q1356748) (← links)
- The strongly perfectness of normal product of \(t\)-perfect graphs (Q1376056) (← links)
- Essentially perfect and essentially diperfect graphs (Q1382910) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- Sum-perfect graphs (Q1735702) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- Strongly perfect infinite graphs (Q1895072) (← links)
- The structure of imperfect critically strongly-imperfect graphs (Q1923530) (← links)
- Stable effectivity functions and perfect graphs (Q1974051) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Which claw-free graphs are strongly perfect? (Q2433718) (← links)
