Pages that link to "Item:Q5263816"
From MaRDI portal
The following pages link to Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816):
Displaying 14 items.
- On integer programming with bounded determinants (Q315478) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Deciding whether a planar graph has a cubic subgraph is NP-complete (Q1318823) (← links)
- A method of graph reduction and its applications (Q1669583) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- Independent sets in graphs without subtrees with many leaves (Q3186851) (← links)
- Characterizations of Natural Submodular Graphs: A Polynomially Solvable Class of the TSP (Q4327639) (← links)
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems (Q4713055) (← links)
- (Q5263782) (← links)
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002) (← links)
- New cases of polynomial solvability of the independent set problem for graphs with forbidden triods (Q6078549) (← links)
