Pages that link to "Item:Q5111287"
From MaRDI portal
The following pages link to Recognizing Graphs Close to Bipartite Graphs (Q5111287):
Displaying 12 items.
- Recognition of overlap graphs (Q405660) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- (Q5005166) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)