Pages that link to "Item:Q1685021"
From MaRDI portal
The following pages link to Independent feedback vertex sets for graphs of bounded diameter (Q1685021):
Displaying 23 items.
- Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
- On parameterized independent feedback vertex set (Q690464) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Partition the vertices of a graph into one independent set and one acyclic set (Q2497500) (← links)
- (Q5005166) (← 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)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902531) (← 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)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Domination number and feedback vertex number of complements of line graphs (Q6101458) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
- Sparsity in covering solutions (Q6547950) (← links)
- Near-bipartiteness, connected near-bipartiteness, independent feedback vertex set and acyclic vertex cover on graphs having small dominating sets (Q6606167) (← links)
- Complexity of near-3-choosability problem (Q6632143) (← links)