Pages that link to "Item:Q1978502"

The following pages link to Efficient algorithms for acyclic colorings of graphs (Q1978502):

Displaying 12 items.

• Acyclic and star colorings of cographs (Q643025) (← links)
• 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)
• Acyclic edge-coloring using entropy compression (Q2444732) (← links)
• Coloring graphs using two colors while avoiding monochromatic cycles (Q2815462) (← links)
• Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
• Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles (Q3578378) (← links)
• A Game Theoretic Approach for Efficient Graph Coloring (Q3596717) (← links)
• Efficient algorithms for the edge-cover coloring problem (Q5063668) (← links)
• (Q5501327) (← links)