Pages that link to "Item:Q2497500"
From MaRDI portal
The following pages link to Partition the vertices of a graph into one independent set and one acyclic set (Q2497500):
Displaying 15 items.
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Approximability of the independent feedback vertex set problem for bipartite graphs (Q5919046) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
