Pages that link to "Item:Q5918661"
From MaRDI portal
The following pages link to Colouring graphs of bounded diameter in the absence of small cycles (Q5918661):
Displaying 8 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Diameter of 4-colourable graphs (Q1024307) (← 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)
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference (Q4595652) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Maximum diameter of 3‐ and 4‐colorable graphs (Q6093149) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)