The following pages link to Graph Classes: A Survey (Q4243764):
Displaying 50 items.
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- The micro-world of cographs (Q831855) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Cyclability in graph classes (Q833007) (← links)
- A decentralized control mechanism for stream processing networks (Q839869) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Complexity aspects of generalized Helly hypergraphs (Q845662) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- The interval-merging problem (Q867634) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- All minimal prime extensions of hereditary classes of graphs (Q868943) (← links)
- Networks with small stretch number (Q876723) (← links)
- Maximal proper subgraphs of median graphs (Q878630) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- Topological mappings between graphs, trees and generalized trees (Q884588) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Dependence polynomials of some graph operations (Q895839) (← links)
- Graph limits and hereditary properties (Q896080) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- Games on interval and permutation graph representations (Q897865) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- The chromatic number of a signed graph (Q907266) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- On orthogonal ray trees (Q908312) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs (Q941349) (← links)
- Extremal perfect graphs for a bound on the domination number (Q952634) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Rooted directed path graphs are leaf powers (Q965972) (← links)
