The following pages link to Graph Classes: A Survey (Q4243764):
Displaying 50 items.
- Spanning trees in random series-parallel graphs (Q256329) (← links)
- Clique-width of path powers (Q266933) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- A unified approach to recognize squares of split graphs (Q313959) (← links)
- On the OBDD representation of some graph classes (Q317396) (← links)
- On containment graphs of paths in a tree (Q324771) (← links)
- A Gröbner basis characterization for chordal comparability graphs (Q326658) (← links)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Star chromatic bounds (Q327688) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- A note on path domination (Q339493) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- New results on word-representable graphs (Q344843) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Thin strip graphs (Q344860) (← links)
- Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- The minimum vulnerability problem on specific graph classes (Q346526) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- A note on sparseness conditions on chordless vertices of cycles (Q385389) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows (Q389670) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- Split clique graph complexity (Q393107) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
