The following pages link to Andreas Brandstädt (Q170457):
Displayed 50 items.
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- LexBFS-orderings and powers of chordal graphs (Q1363684) (← links)
- Mixed interval hypergraphs (Q1364778) (← links)
- Duchet-type theorems for powers of HHD-free graphs (Q1377865) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- Graphs with least domination number three-fifths their order (Q1567273) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs (Q1603536) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Perfect elimination orderings of chordal powers of graphs (Q1815326) (← links)
- On efficient parallel computations of costs of paths on a grid graph (Q1824395) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- Strong equality of domination parameters in trees (Q1861245) (← links)
- Tree spanners on chordal graphs: complexity and algorithms (Q1884978) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- Short disjoint cycles in graphs with degree constraints (Q1917248) (← links)
- Partitions of graphs into one or two independent sets and cliques (Q1917483) (← links)
- Incidence graphs of biacyclic hypergraphs (Q1923616) (← links)
- Cycle transversals in perfect graphs and cographs (Q1935798) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Recognizing the \(P_4\)-structure of block graphs (Q1962056) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196) (← links)
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557) (← links)
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Clique-width for 4-vertex forbidden subgraphs (Q2432547) (← links)
- A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- A finiteness theorem for primal extensions (Q2484373) (← links)
- Bisplit graphs (Q2568470) (← links)
- Efficient domination and efficient edge domination: a brief survey (Q2636549) (← links)
- Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs (Q2706129) (← links)
- (Q2766671) (← links)
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
- New Polynomial Cases of the Weighted Efficient Domination Problem (Q2849909) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)