Pages that link to "Item:Q2081467"
From MaRDI portal
The following pages link to Exact algorithms for counting 3-colorings of graphs (Q2081467):
Displaying 5 items.
- Perfect precise colourings of \(\{3,n\}\) with \(n\) colours (Q1021286) (← links)
- Method of 3-colouring of graphs (Q1123201) (← 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)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)
