Pages that link to "Item:Q1978502"
From MaRDI portal
The following pages link to Efficient algorithms for acyclic colorings of graphs (Q1978502):
Displaying 6 items.
- Heuristics for deciding collectively rational consumption behavior (Q719014) (← links)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application. (Q1853125) (← links)
- Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
