The following pages link to (Q3416248):
Displaying 50 items.
- Graphs with induced-saturation number zero (Q276201) (← links)
- Bounds on the regularity and projective dimension of ideals associated to graphs (Q356743) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- On the recognition of fuzzy circular interval graphs (Q408180) (← links)
- Coloring fuzzy circular interval graphs (Q412282) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Edge decomposition of connected claw-free cubic graphs (Q777388) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- The stable set polytope of icosahedral graphs (Q898118) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- On facets of stable set polytopes of claw-free graphs with stability number 3 (Q960958) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← links)
- A note on 2-bisections of claw-free cubic graphs (Q1752606) (← links)
- Claw-free graphs. VII. Quasi-line graphs (Q1931400) (← links)
- Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
- The structure of claw-free binary matroids (Q2040015) (← links)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Cycle traversability for claw-free graphs and polyhedral maps (Q2216923) (← links)
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs (Q2227542) (← links)
- On Gorenstein graphs (Q2240742) (← links)
- Coloring vertices of claw-free graphs in three colors (Q2251141) (← links)
- Graphs without five-vertex path and four-vertex cycle (Q2286127) (← links)
- Some observations on the smallest adjacency eigenvalue of a graph (Q2295999) (← links)
- Normal 6-edge-colorings of some bridgeless cubic graphs (Q2306603) (← links)
- Distance-regular graphs without 4-claws (Q2311358) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
