The following pages link to Graph Classes: A Survey (Q4243764):
Displaying 50 items.
- Graph classes and Ramsey numbers (Q400493) (← links)
- A characterization of line graphs that are squares of graphs (Q400504) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- A characterization of substar graphs (Q401150) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Finding intersection models: from chordal to Helly circular-arc graphs (Q409451) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- On weighted efficient total domination (Q414423) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Edge search number of cographs (Q415273) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- Edge contractions in subclasses of chordal graphs (Q423902) (← links)
- A note on connected dominating sets of distance-hereditary graphs (Q423975) (← links)
- Four-cycled graphs with topological applications (Q434228) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- The recognition of triangle graphs (Q441856) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Efficient total domination in digraphs (Q450576) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Characterizing and computing the structure of clique intersections in strongly chordal graphs (Q479046) (← links)
- Complete monotonicity for inverse powers of some combinatorially defined polynomials (Q483372) (← links)
- On graphs associated to sets of rankings (Q491081) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Spanning trees with nonseparating paths (Q501078) (← links)
- Comparing the metric and strong dimensions of graphs (Q507581) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs (Q534056) (← links)
- Block-graph width (Q534563) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
