Pages that link to "Item:Q1068855"
From MaRDI portal
The following pages link to The struction of a graph: Application to CN-free graphs (Q1068855):
Displaying 21 items.
- Weighted stability number of graphs and weighted satisfiability: the two facets of pseudo-Boolean optimization (Q537589) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) (Q1080863) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- Stability number of bull- and chair-free graphs (Q1208469) (← links)
- The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- On the use of Boolean methods for the computation of the stability number (Q1363750) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Struction revisited (Q1414580) (← links)
- Polynomially solvable cases for the maximum stable set problem (Q1894362) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- On the vertex packing problem (Q2366214) (← links)
- On Hamiltonicity of \{claw, net\}-free graphs (Q2433732) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Local transformations of graphs preserving independence number (Q4242792) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
