Pages that link to "Item:Q3608832"
From MaRDI portal
The following pages link to Improved Exact Algorithms for Counting 3- and 4-Colorings (Q3608832):
Displaying 7 items.
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← 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)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
- Enumeration of minimal tropical connected sets (Q6057321) (← links)