The following pages link to Graph Classes: A Survey (Q4243764):
Displaying 50 items.
- Witness (Delaunay) graphs (Q551502) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476) (← links)
- Cover-incomparability graphs and chordal graphs (Q602752) (← links)
- Farey graphs as models for complex networks (Q627190) (← links)
- On the Colin de Verdière number of graphs (Q630509) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Two characterizations of chain partitioned probe graphs (Q646714) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- How to guard a graph? (Q652526) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- Separable \(d\)-permutations and guillotine partitions (Q659578) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Altitude of wheels and wheel-like graphs (Q707998) (← links)
- Enumeration of the perfect sequences of a chordal graph (Q708216) (← links)
- Edge critical cops and robber (Q708375) (← links)
- Mixed unit interval graphs (Q713160) (← links)
- Multiflows in symmetric digraphs (Q713317) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind (Q723786) (← links)
- Some variations of perfect graphs (Q726645) (← links)
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Containment relations in split graphs (Q765349) (← links)
