Pages that link to "Item:Q709325"

The following pages link to Maximum independent sets in 3- and 4-regular Hamiltonian graphs (Q709325):

Displayed 13 items.

• On bipartization of cubic graphs by removal of an independent set (Q298966) ‎ (← links)
• Computational complexity of the vertex cover problem in the class of planar triangulations (Q1744983) ‎ (← links)
• Algorithm to find a maximum 2-packing set in a cactus (Q1748991) ‎ (← links)
• On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) ‎ (← links)
• A note on the fine-grained complexity of MIS on regular graphs (Q2032165) ‎ (← links)
• Multistage vertex cover (Q2135630) ‎ (← links)
• On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) ‎ (← links)
• Feedback vertex set on Hamiltonian graphs (Q2672436) ‎ (← links)
• Large Independent Sets in Subquartic Planar Graphs (Q2803824) ‎ (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) ‎ (← links)
• On the maximum edge-pair embedding bipartite matching (Q5918365) ‎ (← links)
• Temporal interval cliques and independent sets (Q6039892) ‎ (← links)
• Establishing herd immunity is hard even in simple geometric networks (Q6057292) ‎ (← links)