Pages that link to "Item:Q261372"
From MaRDI portal
The following pages link to Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372):
Displaying 12 items.
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Faster 3-Coloring of Small-Diameter Graphs (Q5866453) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
