Pages that link to "Item:Q3177885"
From MaRDI portal
The following pages link to Coloring 3-Colorable Graphs with Less than <i>n</i> <sup>1/5</sup> Colors (Q3177885):
Displaying 12 items.
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\) (Q1686044) (← links)
- Distinguishing colorings of 3-connected planar graphs with five colors (Q2799604) (← links)
- A (5,5)-Colouring of <i>K</i><sub><i>n</i></sub> with Few Colours (Q4554774) (← links)
- (Q5092401) (← links)
- (Q5212563) (← links)
- (Q5870293) (← links)
- (Q5875482) (← links)
- Topology and Adjunction in Promise Constraint Satisfaction (Q5885596) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Coloring tournaments with few colors: algorithms and complexity (Q6654122) (← links)