The following pages link to Graph Classes: A Survey (Q4243764):
Displaying 19 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- Integration of topological measures for eliminating non-specific interactions in protein interaction networks (Q1026211) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- On the domination search number (Q1811076) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- On the threshold of intractability (Q2051847) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
