On minimal complex classes of graphs
From MaRDI portal
boundary classcomputational complexitylist-ranking problemminimal hard classrecognition of hereditary property
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- Minimal hard classes of graphs for the edge list-ranking problem
- Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
- Boundary classes of graphs for some recognition problems
- Boundary classes for the list-ranking problems in the case of forests
- The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
Cited in
(14)- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
- Minimal hard classes of graphs for the edge list-ranking problem
- Boundary classes for the list-ranking problems in the case of forests
- On integer programming with bounded determinants
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- scientific article; zbMATH DE number 4179393 (Why is no real title available?)
- scientific article; zbMATH DE number 7397959 (Why is no real title available?)
- Critical hereditary graph classes: a survey
- The complexity analysis of the edge-ranking problem for hereditary graph classes with at most three prohibitions
- Classes of graphs critical for the edge list-ranking problem
- Critical elements in combinatorially closed families of graph classes
- Boundary properties of graphs for algorithmic graph problems
- On minimal Folkman graphs
- Minimal Euclidean representations of graphs
This page was built for publication: On minimal complex classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115202)
