Pages that link to "Item:Q1944084"
From MaRDI portal
The following pages link to Dominating set based exact algorithms for \(3\)-coloring (Q1944084):
Displaying 8 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. (Q2768314) (← links)
- Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657) (← links)
- 3-coloring in time (Q4652410) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)