Pages that link to "Item:Q551178"

The following pages link to Boundary properties of graphs for algorithmic graph problems (Q551178):

Displaying 10 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)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)