Pages that link to "Item:Q2927657"
From MaRDI portal
The following pages link to Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657):
Displaying 9 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. (Q2768314) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)