The following pages link to Paw-free graphs (Q1108293):
Displaying 50 items.
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Dominating cycles and forbidden pairs containing \(P_5\) (Q343722) (← links)
- A note on sparseness conditions on chordless vertices of cycles (Q385389) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
- On indicated coloring of graphs (Q897289) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Two classes of perfect graphs (Q1112847) (← links)
- On perfectness of sums of graphs (Q1296974) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- On the quasi-locally paw-free graphs (Q1810626) (← links)
- Perfectly colorable graphs (Q1944175) (← links)
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs (Q1999727) (← links)
- Chromatic symmetric functions and \(H\)-free graphs (Q2000573) (← links)
- Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
- Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Characterizing forbidden pairs for relative length of longest paths and cycles (Q2138962) (← links)
- On indicated coloring of lexicographic product of graphs (Q2161277) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Graphs with few trivial characteristic ideals (Q2229515) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Two forbidden induced subgraphs and well-quasi-ordering (Q2275404) (← links)
- Characterizing the difference between graph classes defined by forbidden pairs including the claw (Q2287737) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- The chromatic discrepancy of graphs (Q2341751) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Forbidden pairs and the existence of a dominating cycle (Q2515588) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
