Pages that link to "Item:Q1850536"
From MaRDI portal
The following pages link to Face covers and the genus problem for apex graphs (Q1850536):
Displaying 33 items.
- Regular independent sets (Q260019) (← links)
- Optimizing phylogenetic diversity with ecological constraints (Q659637) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Combinatorial conjectures that imply local log-concavity of graph genus polynomials (Q896075) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- \(\mathcal{P}\)-apex graphs (Q1708380) (← links)
- The complexity of the Clar number problem and an exact algorithm (Q1708506) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Secure total domination in graphs: bounds and complexity (Q1786876) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Labeled \(K_{2,t}\) minors in plane graphs (Q1850592) (← links)
- Embeddings of planar graphs that minimize the number of long-face cycles (Q1866981) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- Some vertex/edge-degree-based topological indices of \(r\)-apex trees (Q2051642) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- Complexity of paired domination in AT-free and planar graphs (Q2166758) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Grid induced minor theorem for graphs of small degree (Q2692786) (← links)
- A Characterization of $K_{2,4}$-Minor-Free Graphs (Q2808156) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- On the complexity of anchored rectangle packing (Q5075741) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)
- (Q6149323) (← links)
- Computing maximum matchings in temporal graphs (Q6168321) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
