Pages that link to "Item:Q3075609"
From MaRDI portal
The following pages link to On the Maximum Independent Set Problem in Subclasses of Planar Graphs (Q3075609):
Displaying 19 items.
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- Vertex-transitive CIS graphs (Q472401) (← links)
- On minimum maximal distance-\(k\) matchings (Q509288) (← links)
- The maximal \(f\)-dependent set problem for planar graphs is in NC (Q673069) (← links)
- On the maximum independent set problem in graphs of bounded maximum degree (Q778157) (← links)
- A method of graph reduction and its applications (Q1669583) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Layered graphs: applications and algorithms (Q2287476) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- Remarks on the complexity of signed \(k\)-independence on graphs. (Q2828875) (← links)
- On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs (Q2870037) (← links)
- An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812) (← links)
- Classes of subcubic planar graphs for which the independent set problem is polynomially solvable (Q5263816) (← links)
- Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs (Q5374002) (← links)
- On Edge-Independent Sets (Q5405939) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)
