Pages that link to "Item:Q551178"
From MaRDI portal
The following pages link to Boundary properties of graphs for algorithmic graph problems (Q551178):
Displaying 18 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- On integer programming with bounded determinants (Q315478) (← links)
- The width and integer optimization on simplices with bounded minors of the constraint matrices (Q315480) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Boundary properties of well-quasi-ordered sets of graphs (Q382896) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Role colouring graphs in hereditary classes (Q2034782) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Boundary graph classes for some maximum induced subgraph problems (Q2444152) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← links)
- Boundary Properties of Factorial Classes of Graphs (Q4982282) (← links)
- Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
