The following pages link to (Q4232836):
Displaying 10 items.
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- On the vertex arboricity of planar graphs of diameter two (Q2384426) (← links)
- Partition the vertices of a graph into one independent set and one acyclic set (Q2497500) (← links)
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
